Apparatus and method for alignmemt of spatial or temporal non-overlapping images sequences

ABSTRACT

A method and system for computing at least one of spatial and temporal relationships between at least first and second sequences of representations having respective first and second temporal progressions and including employing the first and second temporal progressions to obtain at least one of the spatial and temporal relationships.

FIELD OF THE INVENTION

[0001] The present invention relates to methodologies and systems for combining and integrating visual information from various sources.

BACKGROUND OF THE INVENTION

[0002] The problem of image alignment or image registration has been extensively researched and successful methods for solving this problem have been developed. Some of these methods are based on matching extracted local image features. Other approaches are based on directly matching image intensities. However, all these methods share one basic assumption: that there is sufficient overlap between the images to allow extraction of common image properties, namely, that there is sufficient “similarity” between the images. The term similarity is used here in the broadest sense, for example: gray-level similarity, feature similarity, similarity of frequencies and statistical similarity, such as mutual information. Consequently, the prior art does not provide alignment between images where there is very little similarity between the images or where there is no spatial overlap between the images.

[0003] However, a sequence of images contains much more information than any individual image does. For example: a sequence of images of a scene contains temporal changes caused by dynamic changes in the scene, or temporal changes induced by the motion of the camera. This information is employed by the present invention to provide alignment between images of the two sequences of images even when the sequences have no spatial overlap or have very low similarity.

[0004] State of the art methods for sequence-to-sequence alignment, and other relevant technologies, are described in:

[0005] [1] S. Avidan and A. Shashua. Threading fundamental matrices. In European Conference on Computer Vision, 1998.

[0006] [2] P. A. Beardsley, P. H. S. Torr and A. Zisserman. 3D model acquisition from extended image sequences. In Proc. 4^(th) European Conference on Computer Vision, LNCS 1065, Cambridge, pages 683-695, 1996.

[0007] [3] P. R. Burt and R. J. Kolczynski. Enhanced image capture through fusion. In International Conference on Computer Vision, 1993.

[0008] [4] Y. Caspi and M. Irani. A step towards sequence-to-sequence alignment. In IEEE Conference on Computer Vision and Pattern Recognition, Hilton Head Island, S.C., June 2000.

[0009] [5] D. Demirdijian, A. Zisserman and R. Horaud. Stereo autocalibration from one plane. In European Conference on Computer Vision, 2000.

[0010] [6] Y. Dufournaud, C. Schmid and R. Horaud. Matching images with different resolutions. In IEEE Conference on Computer Vision and Pattern Recognition, Hilton Head Island, S.C., June 2000.

[0011] [7] C. E. Pearson (ed). Handbook of applied mathematics—Second Edition. Van Nostrand Reinhold Company, New York, 1983, pp 898.

[0012] [8] F. R. Gantmakher. The theory of matrices. Chapter VIII, Chelsea Pub., New York, 1959.

[0013] [9] Gene Golub and Charles Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore and London, pp. 123-127, 1989

[0014] [10] Richard I. Hartley. In Defence of the 8-point Algorithm. In Pattern Recognition and Machine Intelligence 19 (6) June pages 580-593 1997

[0015] [11] R. Hartley and A. Zisserman. Multiple View Geometry in Computer Vision. Chapter 3, Cambridge university press, Cambridge, 2000.

[0016] [12] R. Horaud and G. Csurka. Reconstruction using motions of a stereo rig. In International Conference on Computer Vision, pages 96-103, 1998.

[0017] [13] R. Horaud and F. Dornaika. Hand-eye calibration. International Journal of Robotics Research, 14(3):195-210, June 1995.

[0018] [14] M. Irani and P. Anandan. About direct methods. In Vision Algorithms Workshop, pages 267-277, Corfu, 1999.

[0019] [15] M. Irani, P. Anandan and D. Weinshall. From reference frames to reference planes: Multi-view parallax geometry and applications. In European Conference on Computer Vision, Freiburg, June 1998.

[0020] [16] M. Irani, B. Rousso and S. Peleg. Computing occluding and transparent motions. International Journal of Computer Vision, 12(1):5-16, January 1994.

[0021] [17] R. Kumar, P. Anandan and K. Hanna. Direct recovery of shape from multiple views: parallax based approach. In International Conference on Pattern Recognition, 1994.

[0022] [18] Harpreet Sawhney. 3D geometry from planar parallax. In IEEE Conference on Computer Vision and Pattern Recognition, June 1994.

[0023] [19] A. Shashua and N. Navab. Relative affine structure: Theory and application to 3D reconstruction from perspective views. In IEEE Conference on Computer Vision and Pattern Recognition, pages 483-489, Seattle, Wash., June 1994.

[0024] [20] G. P. Stein. Tracking from multiple view points: Self-calibration of space and time. In DARPA IU Workshop, pages 1037-1042, 1998.

[0025] [21] P. H. S. Torr and A. Zisserman. Feature based methods for structure and motion estimation. In Vision Algorithms Workshop, pages 279-329, Corfu, 1999.

[0026] [22] R. Y. Tsai and R. K. Lenz. A new technique for full autonomous and efficient. 3D robotics hand/eye calibration. IEEE Journal of Robotics and Automation, 5(3):345-358, June 1989.

[0027] [23] P. Viola and W. Wells III. Alignment by maximization of mutual information. In International Conference on Computer Vision, pages 16-23, 1995.

[0028] [24] A. Zisserman, P. A. Beardsley and I. D. Reid. Metric calibration of a stereo rig. In Workshop on Representations of Visual Scenes, pages 93-100, 1995.

[0029] [25] P. H. S. Torr and A. Zisserman. Feature based methods for structure and motion estimation. In Vision Algorithms Workshop, pages 279-290, Corfu, 1999.

[0030] [26] Z. Zhang, R. Deriche, O. Faugeras, and Q. Luong. A robust technique for matching two uncalibrated images through the recovery of the unknown epipolar geometry. Artificial Intelligence, 78:87-119, 1995.

[0031] The disclosures of all publications mentioned in the specification and of the publications cited therein are hereby incorporated by reference.

SUMMARY OF THE INVENTION

[0032] This invention seeks to provide methodologies and systems for combining and integrating visual information from various sources.

[0033] The present invention replaces a requirement of “coherent appearance”, which is a fundamental assumption in prior art image alignment methods, with a requirement of “consistent temporal behavior”. The requirement of “consistent temporal behavior” is easier to satisfy, for example by producing two sequences of images using two cameras moved jointly in space. The present invention is therefore useful not only in cases of non-overlapping sequences, but also in cases which are inherently difficult for standard image alignment techniques.

[0034] In a preferred embodiment of the present invention the two cameras are attached closely to each other, so that their centers of projection are very close, and move jointly in space. In this case the induced frame-to-frame transformations within each sequence have correlated behavior across the two sequences.

[0035] A preferred embodiment of the present invention employs correlated temporal behavior to resolve both spatial and temporal transformations between images of the two sequences.

[0036] The present invention is therefore useful for a variety of real-world applications, including:

[0037] (i) Multi-sensor alignment for image fusion. This requires accurate alignment of images obtained by sensors of different sensing modalities, such as Infra-Red and visible light. Such images differ significantly in their appearance due to different sensor properties.

[0038] (ii) Alignment of image sequences obtained at different zooms. The problem here is that different image features are prominent at different image resolutions. Alignment of a wide-field-of-view sequence with a narrow-field-of-view sequence is useful for detecting small zoomed-in objects inside or outside a zoomed-out view of the scene. This can be useful in surveillance applications.

[0039] (iii) Generation of wide-screen movies from multiple non-overlapping narrow FOV movies, such as in IMAX™ movies.

[0040] It is appreciated that the term “correlated” as used in the specification and claims of the present application includes inter alia the following: mathematical correlation, statistical correlation and any other co-relationship.

[0041] There is thus provided in accordance with a preferred embodiment of the present invention a method for computing at least one of spatial and temporal relationships between at least first and second sequences of representations having respective first and second temporal progressions. The method includes employing the first and second temporal progressions to obtain at least one of the spatial and temporal relationships.

[0042] There is also provided in accordance with a preferred embodiment of the present invention a method for computing at least one of spatial and temporal relationships between at least first and second sequences of representations having respective first and second temporal progressions. The method includes employing only the first and second temporal progressions to obtain at least one of the spatial and temporal relationships.

[0043] There is further provided in accordance with a preferred embodiment of the present invention a system for computing at least one of spatial and temporal relationships between at least first and second sequences of representations having respective first and second temporal progressions. The system includes input functionality for receiving the first sequence of representations and the first temporal progression and the second sequence of representations and the second temporal progression and computation functionality employing at least one of the first sequence of representations and the first temporal progression and at least one of the second sequence of representations and the second temporal progression to obtain at least one of the spatial and temporal relationships.

[0044] There is further provided in accordance with another preferred embodiment of the present invention a system for computing at least one of spatial and temporal relationships between at least first and second sequences of representations having respective first and second temporal progressions. The system includes input functionality for receiving the first and second temporal progressions and computational functionality employing the first and second temporal progressions to obtain at least one of the spatial and temporal relationships.

[0045] Further in accordance with a preferred embodiment of the present invention the method also includes computing the first and second temporal progressions which are then employed to obtain at least one of the spatial and temporal relationships.

[0046] Preferably, the representations include visual representations, images and at least three-dimensional objects.

[0047] Still further in accordance with a preferred embodiment of the present invention the step of employing obtains the spatial relationship, and/or the temporal relationship.

[0048] Additionally in accordance with a preferred embodiment of the present invention the employing step obtains the spatial and temporal relationships in the absence of a spatial overlap between the representations

[0049] Additionally or alternatively, the employing step obtains the spatial and temporal relationships in the absence of common spatial information between the representations.

[0050] Further in accordance with a preferred embodiment of the present invention the step of employing obtains the spatial and temporal relationships in the absence of common information between individual ones of the representations belonging to different ones of the at least first and second sequences.

[0051] Still further in accordance with a preferred embodiment of the present invention the step of employing obtains the spatial and temporal relationships in the absence of common information between any individual ones of the representations belonging to different ones of the at least first and second sequences.

[0052] Additionally in accordance with a preferred embodiment of the present invention the spatial relationship includes at least one parameter of a geometric transformation between the at least first and second sequences of representations.

[0053] Preferably, the spatial relationship includes a 2-dimensional projective transformation.

[0054] Alternatively, the spatial relationship includes a 3-dimensional projective transformation.

[0055] Further in accordance with a preferred embodiment of the present invention the spatial relationship includes a fundamental matrix.

[0056] Still further in accordance with a preferred embodiment of the present invention the spatial relationship includes a 2-dimensional parametric transformation.

[0057] Additionally in accordance with a preferred embodiment of the present invention the spatial relationship includes an at least 3-dimensional parametric transformation.

[0058] Further in accordance with a preferred embodiment of the present invention the spatial relationship includes a 2-dimensional non-parametric transformation.

[0059] Additionally or alternatively, the spatial relationship includes an at least 3-dimensional non-parametric transformation.

[0060] Further in accordance with a preferred embodiment of the present invention the spatial relationship includes a spatial relationship between individual ones of the representations belonging to different ones of the at least first and second sequences.

[0061] Still further in accordance with a preferred embodiment of the present invention the spatial relationship includes a spatial relationship between individual ones of the representations belonging to different ones of the at least first and second sequences, at least one of the individual ones of the representations being an interpolated representation.

[0062] Additionally in accordance with a preferred embodiment of the present invention the spatial relationship includes a spatial relationship between individual ones of the representations belonging to different ones of the at least first and second sequences, one of the individual ones of the representations being an interpolated representation and the other of the individual ones of the representations being a non-interpolated representation.

[0063] Further in accordance with a preferred embodiment of the present invention the temporal relationship includes at least one parameter of a temporal transformation between the at least first and second sequences of representations.

[0064] Still further in accordance with a preferred embodiment of the present invention the temporal relationship includes a time shift between the at least first and second sequences of representations.

[0065] Preferably, the temporal relationship includes an affine transformation in time, a parametric transformation in time and/or a non-parametric transformation in time.

[0066] Further in accordance with a preferred embodiment of the present invention the temporal relationship includes a temporal relationship in time between individual ones of the representations belonging to different ones of the at least first and second sequences.

[0067] Still further in accordance with a preferred embodiment of the present invention the temporal relationship includes a temporal relationship in time between individual ones of the representations belonging to different ones of the at least first and second sequences, at least one of the individual ones of the representations being an interpolated representation.

[0068] Additionally in accordance with a preferred embodiment of the present invention the temporal relationship includes a temporal relationship in time between individual ones of the representations belonging to different ones of the at least first and second sequences. Typically, one of the individual ones of the representations is an interpolated representation and the other of the individual ones of the representations is a non-interpolated representation.

[0069] Preferably, the interpolated representation is interpolated in time and the interpolated representation is interpolated in space.

[0070] Further in accordance with a preferred embodiment of the present invention the first and second temporal progressions include ordered intra-sequence representation-to-representation transformations.

[0071] Still further in accordance with a preferred embodiment of the present invention the first and second temporal progressions include ordered intra-sequence representation-to-representation transformations resulting from relative motion between sensors and a scene.

[0072] Preferably, the intra-sequence representation-to-representation transformations include 2-dimensional projective transformations and/or 3-dimensional projective transformations.

[0073] Further in accordance with a preferred embodiment of the present invention the intra-sequence representation-to-representation transformations include fundamental matrices, 2-dimensional parametric transformations, at least 3-dimensional parametric transformations, 2-dimensional non-parametric transformations, at least 3-dimensional non-parametric transformations and camera matrices.

[0074] Still further in accordance with a preferred embodiment of the present invention the step of employing includes correlating the first and second temporal progressions.

[0075] Additionally in accordance with a preferred embodiment of the present invention the step of employing includes equating properties of the first temporal progression and the second temporal progression.

[0076] Further in accordance with a preferred embodiment of the present invention the step of employing includes correlating properties of the first temporal progression and the second temporal progression.

[0077] Still further in accordance with a preferred embodiment of the present invention the step of employing includes equating a sequential application and at least one of the intra-sequence representation-to-representation transformations of the first temporal progression and an unknown the spatial relationship between the at least first and second sequences with a sequential application of the unknown spatial relationship between the at least first and second sequences and at least one of the intra-sequence representation-to-representation transformations of the second temporal progression.

[0078] Further in accordance with a preferred embodiment of the present invention the step of employing includes equating a composition and at least one of the intra-sequence representation-to-representation transformations of the first temporal progression and an unknown the spatial relationship between the at least first and second sequences with a composition of the unknown spatial relationship between the at least first and second sequences and at least one of the intra-sequence representation-to-representation transformations of the second temporal progression.

[0079] Additionally in accordance with a preferred embodiment of the present invention the step of employing includes obtaining an unknown the spatial relationship between the at least first and second sequences by equating a sequential application and at least one of the intra-sequence representation-to-representation transformations of the first temporal progression and the unknown spatial relationship between the at least first and second sequences with a sequential application of the unknown spatial relationship between the at least first and second sequences and at least one of the intra-sequence representation-to-representation transformations of the second temporal progression.

[0080] Additionally in accordance with a preferred embodiment of the present invention the step of equating includes equating up to a scale factor.

[0081] Further in accordance with a preferred embodiment of the present invention the intra-sequence representation-to-representation transformations include multiple simple motions taking place at least partially at different times.

[0082] Preferably, the intra-sequence representation-to-representation transformations include multiple combinations of multiple simple motions taking place at least partially at different times.

[0083] Preferably, the intra-sequence representation-to-representation transformations include multiple complex motions taking place at least partially at different times.

[0084] Preferably, the intra-sequence representation-to-representation transformations include multiple combinations of multiple complex motions taking place at least partially at different times.

[0085] Further in accordance with a preferred embodiment of the present invention the first and second temporal progressions include ordered intra-sequence representation-to-representation transformations at least some of which result from relative motion between sensors and a scene.

[0086] Still further in accordance with a preferred embodiment of the present invention the step of employing uses multiple combinations of intra-sequence representation-to-representation transformations.

[0087] Further in accordance with a preferred embodiment of the present invention the spatial relationship between the at least first and second sequences of representations results from an acquisition relationship, between first and second sensors acquiring respective the at least first and second sequences, being fixed over time.

[0088] Still further in accordance with a preferred embodiment of the present invention the spatial relationship between the at least first and second sequences of representations results from an acquisition relationship, between first and second sensors acquiring respective the at least first and second sequences, changes in a known way over time.

[0089] Preferably, the acquisition relationship includes relative position, relative orientation and relative internal sensor parameters.

[0090] Further in accordance with a preferred embodiment of the present invention the acquisition relationship is known.

[0091] Alternatively, the acquisition relationship is not known.

[0092] Additionally in accordance with a preferred embodiment of the present invention the at least first and second sequences are acquired generally at the same time.

[0093] Preferably, the at least first and second sequences are acquired generally at different times.

[0094] Further in accordance with a preferred embodiment of the present invention the at least first and second sequences represent measurements from the same scene.

[0095] Additionally in accordance with a preferred embodiment of the present invention the at least first and second sequences represent measurements from different portions of the same scene.

[0096] Additionally or alternatively, the at least first and second sequences represent measurements from different overlapping portions of the same scene.

[0097] Further in accordance with a preferred embodiment of the present invention the at least first and second sequences represent measurements from different non-overlapping portions of the same scene.

[0098] Still further in accordance with a preferred embodiment of the present invention the at least first and second sequences represent measurements from different scenes.

[0099] Alternatively, the scene is two-dimensional.

[0100] Preferably, the scene is at least three-dimensional.

[0101] Further in accordance with a preferred embodiment of the present invention the scene is static. Alternatively, the scene is dynamic.

[0102] Further in accordance with a preferred embodiment of the present invention the measurements are generally the same for each sensor.

[0103] Still further in accordance with a preferred embodiment of the present invention the measurements are generally different for each sensor.

[0104] Preferably, the measurements include at least one of illumination, heat, radiance, electromagnetic radiation, color, distance, density, sound and speed.

[0105] Further in accordance with a preferred embodiment of the present invention the method also includes the step of employing at least one of the spatial and temporal relationships for sequence fusion.

[0106] Additionally in accordance with a preferred embodiment of the present invention the method also includes step of employing at least one of the spatial and temporal relationships for alignment of sequences obtained at different zooms.

[0107] Still further in accordance with a preferred embodiment of the present invention the method also includes the step of employing at least one of the spatial and temporal relationships for surveillance.

[0108] Further in accordance with a preferred embodiment of the present invention the method also includes the step of employing at least one of the spatial and temporal relationships for generation of wide-screen movies from multiple at least partially non-overlapping narrow field of view movies.

[0109] Additionally in accordance with a preferred embodiment of the present invention the method also includes the step of employing at least one of the spatial and temporal relationships for image fusion.

[0110] Further in accordance with a preferred embodiment of the present invention the method also includes the step of employing at least one of the spatial and temporal relationships for integrating information contained in the at least first and second sequences.

[0111] Still further in accordance with a preferred embodiment of the present invention the method also includes the step of employing at least one of the spatial and temporal relationships for alignment of images obtained at different zooms.

[0112] Additionally in accordance with a preferred embodiment of the present invention the method also includes the step of employing at least one of the spatial and temporal relationships for comparing information contained in the at least first and second sequences.

[0113] Further in accordance with a preferred embodiment of the present invention the method also includes the step of employing at least one of the spatial and temporal relationships for finding differences between information contained in the at least first and second sequences.

[0114] Still further in accordance with a preferred embodiment of the present invention the method also includes the step of employing at least one of the spatial and temporal relationships for finding differences between information contained in the at least first and second sequences relating to the same scene at different times.

[0115] Additionally in accordance with a preferred embodiment of the present invention the method also includes the step of employing at least one of the spatial and temporal relationships for integrating information contained in the at least first and second sequences and thereby providing an information output which exceeds limitations of individual sensors.

[0116] Further in accordance with a preferred embodiment of the present invention the step of employing includes comparing properties of the first temporal progression and the second temporal progression.

[0117] Still further in accordance with a preferred embodiment of the present invention the computation functionality includes functionality for computing the first and second temporal progressions which are then employed to obtain at least one of the spatial and temporal relationships.

[0118] Additionally in accordance with a preferred embodiment of the present invention the system also includes temporal progression computation functionality for computing the first and second temporal progressions and supplying them to the input functionality.

BRIEF DESCRIPTION OF THE DRAWINGS AND APPENDICES

[0119] The present invention will be understood and appreciated more fully from the following detailed description, taken in conjunction with the drawings in which:

[0120]FIG. 1A is a simplified illustration of two cameras, fixed to each other, each taking a sequence of images of a portion of a scene, the portions of the scene photographed by the two cameras being non-overlapping;

[0121]FIG. 1B illustrates inherent ambiguities in the relative spatial relationship of images in the sequences taken as shown in FIG. 1A;

[0122]FIG. 1C illustrates portions of two sequences of images taken as shown in FIG. 1A and the unknown temporal relationship between the sequences;

[0123]FIG. 1D illustrates pairs of images forming part of the sequences of images taken as shown in FIG. 1A, whose spatial and temporal relationships are determined in accordance with the present invention;

[0124]FIG. 2A is a simplified illustration of two cameras, fixed to each other, each taking a sequence of images of a portion of a scene, the portions of the scene being photographed at significantly different zooms by the two cameras;

[0125]FIG. 2B illustrates inherent ambiguities in the relative spatial relationship of images in the sequences taken as shown in FIG. 2A;

[0126]FIG. 2C illustrates portions of two sequences of images taken as shown in FIG. 2A and the unknown temporal relationship between the sequences;

[0127]FIG. 2D illustrates pairs of images forming part of the sequences of images taken as shown in FIG. 2A, whose spatial and temporal relationships are determined in accordance with the present invention;

[0128]FIG. 3A is a simplified illustration of two sensors, fixed to each other, each taking a sequence of images of a portion of a scene, the portions of the scene being imaged by the two sensors employing different sensing modalities;

[0129]FIG. 3B illustrates inherent ambiguities in the relative spatial relationship of images in the sequences taken as shown in FIG. 3A;

[0130]FIG. 3C illustrates portions of two sequences of images taken as shown in FIG. 3A and the unknown temporal relationship between the sequences;

[0131]FIG. 3D illustrates pairs of images forming part of the sequences of images taken as shown in FIG. 3A, whose spatial and temporal relationships are determined in accordance with the present invention;

[0132]FIG. 4A is a simplified illustration of a scene being photographed at two different times, producing two corresponding sequences of images, the path traveled by a camera used for photographing being generally identical for both sequences;

[0133]FIG. 4B illustrates inherent ambiguities in the relative spatial relationship of images in the sequences taken as shown in FIG. 4A;

[0134]FIG. 4C illustrates portions of two sequences of images taken as shown in FIG. 4A and the unknown temporal relationship between the sequences;

[0135]FIG. 4D illustrates pairs of images forming part of the sequences of images taken as shown in FIG. 4A, whose spatial and temporal relationships are determined in accordance with the present invention;

[0136]FIG. 5A illustrates the relationships between image to image transformations within two sequences, induced by motion of two cameras along an axis, the two cameras being arranged at 180 degrees with respect to each other along the axis;

[0137]FIG. 5B illustrates the relationships between image to image transformations within two sequences, induced by motion of two cameras along an axis, the two cameras being arranged at 90 degrees with respect to each other, one of the cameras being aligned along the axis of motion;

[0138]FIG. 5C illustrates the relationships between image to image transformations within two sequences, induced by motion of two cameras along an axis, the two cameras being directed in the same direction perpendicular to the direction of motion but at different zooms;

[0139]FIGS. 6A, 6B and 6C together illustrate that employing one type of transformation may not be sufficient for resolving ambiguities in the spatial and temporal relationships between sequences but that employing multiple different types of transformations reduces ambiguities in the spatial and temporal relationships between sequences;

[0140]FIG. 7 is a simplified illustration of a complex motion of two cameras, fixed to each other, each taking a sequence of images of a portion of a scene, the portions of the scene photographed by the two cameras being non-overlapping;

[0141]FIG. 8 is a simplified illustration portions of two sequences of images taken as shown in FIG. 7, wherein the two sequences are spatially related by a fixed and unknown inter-camera homography and temporally related by a fixed and unknown time shift.

[0142]FIG. 9 is a simplified functional block diagram of a preferred process of creating two sequences of images and aligning them.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

[0143] Reference is now made to FIGS. 1A-1D which illustrate resolution of spatial and temporal relationships between sequences of images taken by two moving cameras fixed to each other in accordance with the present invention.

[0144] As seen in FIG. 1A, two cameras, designated respectively by reference numerals 100 and 102 are fixed to each other in any suitable manner. Each camera takes a sequence of images of a portion of a scene as the cameras move while they are fixed together. The movement of the cameras may be any suitable movement, such as rotation and/or translation in one or more dimensions and relative to any suitable point. Thus, for example, the two cameras 100 and 102 may rotate about the optical axis of one of the cameras or about any other axis. Similarly, translation of the cameras may occur in any suitable direction.

[0145] In the present case (FIGS. 1A-1D) portions of the scene photographed by the two cameras are non-overlapping and are designated respectively by reference numerals 104 and 106.

[0146] Turning now to FIG. 1B, it is seen that the portions 104 and 106 of the scene of FIG. 1A may be represented by corresponding images 108 and 110. As seen in FIG. 1C, images 108 and 110 each belong to a sequence of images, each produced by one of the moving cameras 100 and 102, the respective sequences being designated by reference numerals 112 and 114. It is seen that sequence 112 also includes images 122, 124 and 126. Likewise, sequence 114 also includes images 130, 132 and 134.

[0147] A problem addressed by the present invention is that the visual information contained in individual pairs of images, one belonging to sequence 112 and the other belonging to sequence 114, (e.g. (108, 110), (122, 130) or (122, 134)), is sufficient to establish neither the spatial nor the temporal relationship between two images of a pair. More generally, the visual information contained in individual pairs of images, one of the pair belonging to sequence 112 and the other of the pair belonging to sequence 114, is sufficient to establish neither the spatial nor the temporal relationship between the two sequences 112 and 114.

[0148] In the context of FIGS. 1A-1D, two images are the to be in the same “temporal relationship” if they are taken at the same time.

[0149] The unknown spatial relationship of images 108 and 110 is seen graphically by considering three examples of possible relative spatial relationships shown in FIG. 1B and designated by reference numerals 116, 118 and 120. In each example, the two images 108 and 110 are placed in a different spatial relationship, all of which are consistent with the visual content of the images 108 and 110.

[0150] The unknown temporal relationship of sequences 112 and 114 is seen graphically by considering FIG. 1C. It is appreciated that it is not apparent from a cursory examination of sequences 112 and 114, which images in sequence 112 are taken at the same time as which images in sequence 114.

[0151] The present invention provides a system and technique for determining the correct relationship between the images 108 and 110 and more generally the correct spatial and temporal relationships between sequences 112 and 114, as shown in FIG. 1D. Thus, it may be appreciated that the present invention determines which image in sequence 112 corresponds in time with which image in sequence 114 and further determines the spatial relationship between the images which correspond in time.

[0152] Thus it is seen in FIG. 1D that image A (108) in sequence 112 is found to correspond in time with image b (110) in sequence 114. The correct spatial relationship between images A (122) and b (110) is shown in FIG. 1D at reference numeral 150. Similarly, image B (122) in sequence 112 is found to correspond in time with image c (132) in sequence 114 and image C (124) in sequence 112 is found to correspond in time with image d (134) in sequence 114. The correct spatial relationship between images B (122) and c (132) is shown in FIG. 1D at reference numeral 152 and the correct spatial relationship between images C (124) and d (134) is shown in FIG. 1D at reference numeral 154.

[0153] The present invention employs an appreciation that despite there being no common static visual information in the two sequences, the image to image dynamics in each of the two sequences are nevertheless related both spatially and temporally. The present invention utilizes the relationship between the dynamics to correlate the two sequences in time and space.

[0154] As will be described hereinbelow in detail, the image to image dynamics preferably are expressed by spatial transformations over time between images in each sequence. The problem of aligning sequences of images in time and space is thus reduced to a problem of determining the relationship between sequences of such transformations in time and in space.

[0155] It is appreciated from a consideration of FIG. 1D, that by employing the present invention aligned sequences may be realized, which sequences may then be utilized to localize two portions of a scene with respect to each other, despite the absence of spatial overlap therebetween.

[0156] Reference is now made to FIGS. 2A-2D which illustrate the resolution of spatial and temporal relationships between sequences of images taken by two moving cameras fixed to each other in accordance with the present invention, the portions of the scene being photographed at significantly different zooms by the two cameras.

[0157] As seen in FIG. 2A, two cameras, designated respectively by reference numerals 200 and 202 are fixed to each other in any suitable manner. Each camera takes a sequence of images of a portion of a scene as the cameras move while they are fixed together. The movement of the cameras may be any suitable movement, such as rotation and/or translation in one or more dimensions and relative to any suitable point. Thus, for example, the two cameras may rotate about the optical axis of one of the cameras or about any other axis. Similarly, translation of the cameras may occur in any suitable direction.

[0158] In the present case (FIGS. 2A-2D) portions of the scene photographed by the two cameras are imaged at significantly different zooms, thus imaging various features in the scene at different spatial scales. Two portions of the scene, which need not necessarily be overlapping, are designated respectively by reference numerals 204 and 206.

[0159] Turning now to FIG. 2B, it is seen that the portions 204 and 206 of the scene of FIG. 2A may be represented by corresponding images 208 and 210, respectively. As seen in FIG. 2C, images 208 and 210 each belong to a sequence of images, each produced by one of the moving cameras 200 and 202, the respective sequences being designated by reference numerals 212 and 214. It is seen that sequence 212 also includes images 222, 224 and 226. Likewise, sequence 214 also includes images 230, 232 and 234.

[0160] It is appreciated that features imaged in the zoomed-in image 210 may be different from the features imaged in the zoomed-out image 208 due to the different spatial scales employed by the cameras. Thus, for example, individual leaves of a tree may be discerned in image 210, while such leaves may not be discernible in image 208. Similarly trees may be discerned in image 208, while only leaves and branches are discernible in image 210.

[0161] A problem addressed by the present invention is that the visual information contained in individual pairs of images, one belonging to sequence 212 and the other belonging to sequence 214, (e.g. (208, 210), (222, 230) or (222, 234)), is sufficient to establish neither the spatial nor the temporal relationship between two images of a pair. More generally, the visual information contained in individual pairs of images, one of the pair belonging to sequence 212 and the other of the pair belonging to sequence 214, is sufficient to establish neither the spatial nor the temporal relationship between the two sequences 212 and 214.

[0162] In the context of FIGS. 2A-2D, two images are the to be in the same “temporal relationship” if they are taken at the same time.

[0163] The unknown spatial relationship of images 208 and 210 is seen graphically by considering three examples of possible relative spatial relationships shown in FIG. 2B and designated by reference numerals 216, 218 and 220. In each example, the two images 208 and 210 are placed in a different spatial relationship with each other, all of which are consistent with the visual content of the images 208 and 210.

[0164] The unknown temporal relationship of sequences 212 and 214 is seen graphically by considering FIG. 2C. It is appreciated that it is not apparent from a cursory examination of sequences 212 and 214, which images in sequence 212 are taken at the same time as which images in sequence 214.

[0165] The present invention provides a system and technique for determining the correct relationship between the images 208 and 210 and more generally the correct spatial and temporal relationships between sequences 212 and 214, as shown in FIG. 2D. Thus, it may be appreciated that the present invention determines which image in sequence 212 corresponds in time with which image in sequence 214 and further determines the spatial relationship between the images which correspond in time.

[0166] Thus it is seen in FIG. 2D that image A (208) in sequence 212 is found to correspond in time with image b (210) in sequence 214. The correct spatial relationship between images A (208) and b (210) is shown in FIG. 2D at reference numeral 250. Similarly, image B (222) in sequence 212 is found to correspond in time with image c (232) in sequence 214 and image C (224) in sequence 212 is found to correspond in time with image d (234) in sequence 214. The correct spatial relationship between images B (222) and c (232) is shown in FIG. 2D at reference numeral 252 and the correct spatial relationship between images C (224) and d (234) is shown in FIG. 2D at reference numeral 254.

[0167] The present invention employs an appreciation that despite there not necessarily being any common static visual information in the two sequences, the image to image dynamics in each of the two sequences are nevertheless related both spatially and temporally. The present invention utilizes the relationship between the dynamics to correlate the two sequences in time and space.

[0168] As will be described hereinbelow in detail, the image to image dynamics preferably are expressed by spatial transformations over time between images in each sequence. The problem of aligning sequences of images in time and space is thus reduced to a problem of determining the relationship between sequences of such transformations in time and in space.

[0169] It is appreciated from a consideration of FIG. 2D, that by employing the present invention aligned sequences may be realized, which sequences may then be utilized to provide high resolution details of a portion of a scene, localized with respect to a zoomed-out view of the scene, providing a wide field of view context.

[0170] Reference is now made to FIGS. 3A-3D which illustrate resolution of spatial and temporal relationships between sequences of images taken by two moving sensors fixed to each other in accordance with the present invention, the portions of the scene being imaged by the two sensors employing different sensing modalities.

[0171] As seen in FIG. 3A, two sensors, such as an infra red (IR) camera 300 and a visible light (VL) camera 302, are fixed to each other in any suitable manner. Each sensor takes a sequence of images of a portion of a scene as the sensors move while they are fixed together. The movement of the sensors may be any suitable movement, such as rotation and/or translation in one or more dimensions and relative to any suitable point. Thus, for example, the two sensors may rotate about the optical axis of one of the sensors or about any other axis. Similarly, translation of the sensors may occur in any suitable direction.

[0172] In the present case (FIGS. 3A-3D) portions of the scene sensed by the two sensors are imaged at different wavelength ranges, thus imaging various features in the scene in different modalities. Two portions of the scene, which need not necessarily be overlapping or at the same zoom, are designated by reference numerals 304 and 306.

[0173] Turning now to FIG. 3B, it is seen that the portions 304 and 306 of the scene of FIG. 3A may be represented by corresponding images 308 and 310. As seen in FIG. 3C, images 308 and 310 each belong to a sequence of images, each produced by one of the moving sensors 300 and 302, the respective sequences being designated by reference numerals 312 and 314. It is seen that sequence 312 also includes images 322, 324 and 326. Likewise, sequence 314 also includes images 330, 332 and 334.

[0174] It is appreciated that features imaged in the infra-red (IR) image 308 may be different from the features imaged in the visible light (VL) image 310 due to the different sensing modalities employed by the sensors. Thus, for example, hot regions may be discerned in image 308, while heat is not sensed in image 310. Similarly the visual appearance of a bus may be discerned in image 310, while features appearing only in visible light are not captured in image 308.

[0175] A problem addressed by the present invention is that the visual information contained in individual pairs of images, one belonging to sequence 312 and the other belonging to sequence 314, (e.g. (308, 310), (322, 330) or (322, 334)), is sufficient to establish neither the spatial nor the temporal relationship between two images of a pair. More generally, the visual information contained in individual pairs of images, one of the pair belonging to sequence 312 and the other of the pair belonging to sequence 314, is sufficient to establish neither the spatial nor the temporal relationship between the two sequences 312 and 314.

[0176] In the context of FIGS. 3A-3D, two images are the to be in the same “temporal relationship” if they are taken at the same time.

[0177] The unknown spatial relationship of images 308 and 310 is seen graphically by considering three examples of possible relative spatial relationships shown in FIG. 3B and designated by reference numerals 316, 318 and 320. In each example, the two images 308 and 310 are placed in a different spatial relationship, all of which are consistent with the visual content of the images 308 and 310.

[0178] The unknown temporal relationship of sequences 312 and 314 is seen graphically by considering FIG. 3C. It is appreciated that it is not apparent from a cursory examination of sequences 312 and 314, which images in sequence 312 are taken at the same time as which images in sequence 314.

[0179] The present invention provides a system and technique for determining the correct relationship between the images 308 and 310 and more generally the correct spatial and temporal relationships between sequences 312 and 314, as shown in FIG. 3D. Thus, it may be appreciated that the present invention determines which image in sequence 312 corresponds in time with which image in sequence 314 and further determines the spatial relationship between the images which correspond in time.

[0180] Thus it is seen in FIG. 3D that image A (310) in sequence 314 is found to correspond in time with image a (308) in sequence 312. The correct spatial relationship between images A (310) and a (308) is shown in FIG. 3D at reference numeral 350. Similarly, image B (330) in sequence 314 is found to correspond in time with image b (322) in sequence 312, image C (332) in sequence 314 is found to correspond in time with image c (324) in sequence 312 and image D (334) in sequence 314 is found to correspond in time with image d (326) in sequence 312. The correct spatial relationship between images B (330) and b (322) is shown in FIG. 3D at reference numeral 352, the correct spatial relationship between images C (332) and c (324) is shown in FIG. 3D at reference numeral 354 and the correct spatial relationship between images D (334) and d (326) is shown in FIG. 3D at reference numeral 356. Thus it may be realized that the hot regions captured in the IR image sequence 312 are in fact the radiator and the exhaust gases of the bus.

[0181] The present invention employs an appreciation that despite there not necessarily being any common static visual information in the two sequences, the image to image dynamics in each of the two sequences are nevertheless related both spatially and temporally. The present invention utilizes the relationship between the dynamics to correlate the two sequences in time and space, without requiring understanding or interpretation of the features captured by the sequences.

[0182] As will be described hereinbelow in detail, the image to image dynamics preferably are expressed by spatial transformations over time between images in each sequence. The problem of aligning sequences of images in time and space is thus reduced to a problem of determining the relationship between sequences of such transformations in time and in space.

[0183] It is appreciated from a consideration of FIG. 3D, that by employing the present invention aligned sequences may be realized, which sequences may then be integrated to provide a composite sequence displaying the totality of information captured by both sequences. In this example, the composite sequence thus captures information over a wavelength range which is beyond that of the individual sensors 300 and 302.

[0184] Reference is now made to FIGS. 4A-4D which illustrate resolution of spatial and temporal relationships between sequences of images of a scene taken at two different times, producing two corresponding sequences of images. A camera used for producing the sequences of images is fixed to a element which travels along a path that is generally identical for both sequences.

[0185] As seen in FIG. 4A, a camera mounted onto an element, traveling along a generally identical path, such as a railroad track, images a scene at two different times, here typically summer and winter. The camera used in the summer is designated by reference numeral 400, while the camera used in the winter is designated by reference numeral 402, it being appreciated that the same camera or different cameras may be employed. The cameras may have the same or different settings.

[0186] Each camera takes a sequence of images of the scene. In this case the scene being imaged at the two different times, has two different appearances, as designated by reference numerals 404 and 406. Reference numeral 404 designates a view of a train bearing camera 400, traveling along railroad track 407 in the summer. Reference numeral 406 designates a view of a train bearing camera 402 traveling along railroad track 407 in the winter.

[0187] Turning now to FIG. 4B, it is seen that cameras 400 and 402 image portions of the views designated by reference numerals 404 and 406 of FIG. 4A, generating respective images 408 and 410. As seen in FIG. 4C, images 408 and 410 each belong to a sequence of images, each produced by one of the moving cameras 400 and 402, the respective sequences being designated by reference numerals 412 and 414. It is seen that sequence 412 also includes images 422, 424 and 426. Likewise, sequence 414 also includes images 430, 432 and 434. It is appreciated that the images in sequence 412 are not necessarily spaced in time (taken at the same time differences) as the images in sequence 414.

[0188] It is appreciated that features imaged in the summer may be different from the features imaged in the winter due, for example to snow cover. Thus, for example, a house seen in sequence 412 is not visible in sequence 414, because it is covered by snow. Similarly snow seen in sequence 414 is not visible in sequence 412.

[0189] A problem addressed by the present invention is that the visual information contained in individual pairs of images, one belonging to sequence 412 and the other belonging to sequence 414, (e.g. (408, 410), (422, 430) or (422, 434)), is sufficient to establish neither the spatial nor the temporal relationship between two images of a pair. More generally, the visual information contained in individual pairs of images, one of the pair belonging to sequence 412 and the other of the pair belonging to sequence 414, is sufficient to establish neither the spatial nor the temporal relationship between the two sequences 412 and 414.

[0190] In the context of FIGS. 4A-4D, two images are the to be in the same “temporal relationship” if an element to which the camera is fixed is at the same location along the path. It is appreciated that the time differences between images 422, 424, 408 and 426 in sequence 412 may or may not be the same as the time differences between the images 430, 432, 410 and 434 in sequence 414.

[0191] The unknown spatial relationship of images 408 and 410 is seen graphically by considering three examples of possible relative spatial relationships shown in FIG. 4B and designated by reference numerals 416, 418 and 420. In each example, the two images 408 and 410 are placed in a different spatial relationship, all of which are consistent with the visual content of the images 408 and 410.

[0192] The unknown temporal relationship of sequences 412 and 414 is seen graphically by considering FIG. 4C. It is appreciated that it is not apparent from a cursory examination of sequences 412 and 414, which images in sequence 412 are taken from the same position along the railroad track 407 as images in sequences 414.

[0193] The present invention provides a system and technique for determining the correct relationship between the images 408 and 410 and more generally the correct spatial and temporal relationships between sequences 412 and 414, as shown in FIG. 4D. Thus, it may be appreciated that the present invention determines which image in sequence 412 corresponds temporally with which image in sequence 414 and further determines the spatial relationship between the images which correspond temporally.

[0194] Thus it is seen in FIG. 4D that image A (422) in sequence 412 is found to correspond temporally with image a (430) in sequence 414. The correct spatial relationship between images A (422) and a (430) is shown in FIG. 4D at reference numeral 450. Similarly, image B (424) in sequence 412 is found to correspond temporally with image b (432) in sequence 414, image C (408) in sequence 412 is found to correspond temporally with image c (410) in sequence 414 and image D (426) in sequence 412 is found to correspond temporally with image d (434) in sequence 414. The correct spatial relationship between images B (424) and b (432) is shown in FIG. 4D at reference numeral 452, the correct spatial relationship between images C (408) and c (410) is shown in FIG. 4D at reference numeral 454 and the correct spatial relationship between images D (426) and d (434) is shown in FIG. 4D at reference numeral 456. Thus the location of the house buried under the snow may be determined in sequence 414 although the house is not visible in that sequence.

[0195] The present invention employs an appreciation that despite there not necessarily being any common static visual information in the two sequences, the image to image dynamics in each of the two sequences are nevertheless related both spatially and temporally. The present invention utilizes the relationship between the dynamics to correlate the two sequences spatially and temporally, without requiring understanding or interpretation of the features captured by the sequences.

[0196] As will be described hereinbelow in detail, the image to image dynamics preferably are expressed by spatial transformations over time between images in each sequence. The problem of aligning sequences of images spatially and temporally is thus reduced to a problem of determining the relationship between sequences of such transformations.

[0197] It is appreciated from a consideration of FIG. 4D, that by employing the present invention aligned sequences may be realized, which sequences may then be employed to determine the location of objects visible in only some sequences across other sequences. The aligned sequences may also be employed to detect changes in a scene, such as man-made changes, which take place during a time interval between acquisitions of different sequences.

[0198] It is also appreciated that the spatial relationship may also be produced by moving at least one camera at different times and/or in different locations, along generally different trajectories, wherein the at least two trajectories are correlated as if they were produced by two cameras that are mounted rigidly on the same device or rig, and moved jointly in space.

[0199] It is appreciated that FIGS. 4A-4D show one example of a possible visualization of the output of the method of the present invention. However, the method is not limited to this particular output or this particular visualization. It is appreciated that, for example, the output can be numerical, in the form of spatial and temporal transformations, or the output can be visual in the form of aligned and/or integrated video sequences.

[0200] When numerical outputs are provided, the output transformations can be provided in various possible coordinate systems and when visual outputs are provided, there are many possible visualizations.

[0201] Reference is now made to FIGS. 5A-5C, which illustrate an important inventive principle underlying the present invention. As noted hereinabove with reference to FIGS. 1A-4D, a difficulty exists in establishing spatial and temporal correspondence between images that have little or no visual information in common.

[0202] Noting that each of the images forms part of a sequence of images which have substantial visual information in common, the present invention overcomes this difficulty by considering intra-sequence spatial transformations between images in each sequence and by then correlating series of such intra-sequence spatial transformations across the sequences.

[0203] It is appreciated that while visual information common to images within a sequence is used to compute the intra-sequence spatial transformations, these transformations, once computed, do not include any visual information and can therefore be readily correlated across sequences. Thus, once series of intra-sequence transformation are found, there is no longer any need to refer back to the visual information in the images themselves.

[0204] It is a particular feature of the present invention that the series of intra-sequence spatial transformations of images taken by cameras whose motion is spatially and temporally interrelated, such as described in any of FIGS. 1A-4D, are spatially and temporally correlated. FIGS. 5A-5C and the following description present examples of these correlations which can be employed in accordance with the present invention to derive the spatial and temporal relationship, notwithstanding a lack of common visual information across the image sequences.

[0205] Specific reference is now made to FIG. 5A, which illustrates the relationships between image to image transformations within two sequences, induced by motion of first and second cameras 500 and 502 along an axis 504, the two cameras being arranged at 180 degrees with respect to each other along the axis. Camera 500 captures a sequence of images 506, while camera 502 captures a sequence of images 508.

[0206] Sequence 506 includes inter alia images 510, 512 and 514, while sequence 508 includes inter alia images 520, 522 and 524. It is seen that the motion of camera 500 along axis 504 in a direction indicated by arrow 526 causes an imaged scene including a house to appear smaller in image 512 than in image 510. This relationship is represented by an intra-sequence image-to-image spatial transformation and the graphical illustration of the transformation from image 510 to image 512 is designated by reference numeral 530. The arrows shown in the transformation represent the displacement of the corresponding points of the image 512 as the image 512 is transformed to image 510. Similarly, it is seen that the motion of camera 500 along axis 504 in a direction indicated by arrow 526 causes the imaged scene including the house to appear smaller in image 514 than in image 512. This relationship is represented by an intra-sequence image-to-image spatial transformation designated by reference numeral 532.

[0207] It is also seen that the motion of camera 502 along axis 504 in a direction indicated by arrow 526 causes an imaged scene including a tree to appear larger in image 522 than in image 520. This relationship is represented by an intra-sequence image-to-image spatial transformation designated by reference numeral 540. Similarly, it is seen that the motion of camera 502 along axis 504 in a direction indicated by arrow 526 causes the imaged scene including the tree to appear larger in image 524 than in image 522. This relationship is represented by an intra-sequence image-to-image spatial transformation designated by reference numeral 542.

[0208] It is appreciated from a comparison of the series of transformations 530 and 532 with the series of transformations 540 and 542 that cameras 500 and 502 appear to be directed in opposite directions as they move jointly.

[0209] Specific reference is now made to FIG. 5B, which illustrates the relationships between image to image transformations within two sequences, induced by motion of first and second cameras 550 and 552 along an axis 554, the two cameras being arranged at 90 degrees with respect to each other, one of the cameras being aligned substantially parallel to the axis of motion 554. Camera 550 captures a sequence of images 556, while camera 552 captures a sequence of images 559.

[0210] Sequence 556 includes inter alia images 560, 562 and 564, while sequence 558 includes inter alia images 570, 572 and 574, It is seen that the motion of camera 550 along axis 554 in a direction indicated by arrow 576 causes an imaged scene including a house to appear shifted sideways to the left in image 562 as compared with image 560. This relationship is represented by an intra-sequence image-to-image spatial transformation designated by reference numeral 580. Similarly, it is seen that the motion of camera 550 along axis 554 in a direction indicated by arrow 576 causes the imaged scene including the house to appear shifted sideways to the left in image 564 as compared with image 562. This relationship is represented by an intra-sequence image-to-image spatial transformation designated by reference numeral 582.

[0211] It is also seen that the motion of camera 552 along axis 554 in a direction indicated by arrow 576 causes an imaged scene including a tree to appear larger in image 572 than in image 570. This relationship is represented by an intra-sequence image-to-image spatial transformation designated by reference numeral 590. Similarly, it is seen that the motion of camera 552 along axis 554 in a direction indicated by arrow 576 causes the imaged scene including the tree to appear larger in image 574 than in image 572. This relationship is represented by an intra-sequence image-to-image spatial transformation designated by reference numeral 592.

[0212] It is appreciated from a comparison of the series of transformations 580 and 582 with the series of transformations 590 and 592 that cameras 550 and 552 appear to be directed perpendicularly to each other as they move jointly.

[0213] Specific reference is now made to FIG. 5C, which illustrates the relationships between image to image transformations within two sequences, induced by motion of first and second cameras 600 and 602 along an axis 604, the two cameras being directed in the same direction perpendicular to the direction of motion along axis 604 but at different zooms. Camera 600 captures a sequence of images 606, while camera 602 captures a sequence of images 668.

[0214] Sequence 606 includes inter alia images 610, 612 and 614, while sequence 608 includes inter alia images 620, 622 and 624. It is seen that the motion of camera 600 along axis 604 in a direction indicated by arrow 626 causes an imaged scene including a house to appear shifted sideways to the left in image 612 as compared with image 610. This relationship is represented by an intra-sequence image-to-image spatial transformation designated by reference numeral 630. Similarly, it is seen that the motion of camera 600 along axis 604 in a direction indicated by arrow 626 causes the imaged scene including the house to appear shifted sideways to the left in image 614 as compared with image 612. This relationship is represented by an intra-sequence image-to-image spatial transformation designated by reference numeral 632.

[0215] It is also seen that the motion of camera 602 along axis 604 in a direction indicated by arrow 626 causes an imaged scene including the house to appear shifted sideways to the left in image 622 as compared with image 620. This relationship is represented by an intra-sequence image-to-image spatial transformation designated by reference numeral 640. Similarly, it is seen that the motion of camera 602 along axis 604 in a direction indicated by arrow 626 causes the imaged scene including the house to appear shifted sideways to the left in image 624 as compared with image 622. This relationship is represented by an intra-sequence image-to-image spatial transformation designated by reference numeral 642. It is noted that the sideways shifts represented by transformations 640 and 642 are larger than those represented by transformations 630 and 632 due to the difference in zooms.

[0216] It is appreciated from a comparison of the series of transformations 630 and 632 with the series of transformations 640 and 642 that cameras 600 and 602 appear directed in the same direction perpendicular to the direction of motion along axis 604 but at different zooms as they move jointly.

[0217] Reference is now made to FIGS. 6A, 6B and 6C, which together illustrate that computational functionality employing one type of transformation may not be sufficient for resolving ambiguities in the spatial and temporal relationships between sequences but that employing multiple different types of transformations reduces ambiguities in the spatial and temporal relationships between sequences.

[0218] Turning to FIG. 6A, it is seen that intra-sequence spatial transformations 650 and 652 representing two oppositely directed sideways movements, each belonging to a sequence taken by a different camera, can represent at least two different arrangements of the cameras. One such arrangement, designated by reference numeral 654 is of first and second cameras, 656 and 658 respectively, moving in a direction 660 along an axis 662 and being arranged in a mutual upside down arrangement and both directed in parallel perpendicular to axis 662.

[0219] Another possible arrangement, designated by reference numeral 664, is of cameras 656 and 658 being arranged at 180 degrees with respect to each other, directed perpendicular to the axis 662 and moving along axis 662 in a direction 660 therealong.

[0220] Turning to FIG. 6B, it is seen that intra-sequence spatial transformations 670 and 672 representing forward and backward motion respective, each belonging to a sequence taken by a different camera, can represent at least two different arrangements of the cameras. One such arrangement, designated by reference numeral 664 is of first and second cameras, 656 and 658 respectively, moving in a direction 680 along an axis 682 and being arranged at 180 degrees with respect to each other along axis 682.

[0221] Another possible arrangement, designated by reference numeral 684, is of cameras 656 and 658 being arranged at 180 degrees with respect to each other along axis 682 for motion in a direction 680 therealong, wherein one of the cameras 656 is rotated about axis 682 with respect to the other one of the cameras 658.

[0222] Turning to FIG. 6C, it is seen that two series of intra-sequence spatial transformations 690 and 692, each taken by a different moving camera, and containing transformations of different types, are employed by computational functionality to resolve ambiguities of the type described hereinabove with reference to FIGS. 6A and 6B. Series 690 comprises transformation 650 (FIG. 6A) followed by transformation 670 (FIG. 6B), while series 692 comprises transformation 652 (FIG. 6A) followed by transformation 672 (FIG. 6B).

[0223] It is seen that only one of the three camera configurations shown in FIGS. 6A, 6B and 6C is possible, namely that configuration designated by reference numeral 664 in FIGS. 6A and 6B.

[0224]FIGS. 1A to 4D described hereinabove present four typical applications of the present invention. In these four applications the present invention provides alignment between images of two sequences of images notwithstanding that there is insufficient similarity between any image of one sequence to any image of the other sequence to enable the prior art to provide image to image alignment. “Similarity” of images is used here in a broad sense and includes, inter alia, gray-level similarity, feature similarity, similarity of frequencies and statistical similarity, such as mutual information. Consequently, in the prior art, at least partial overlap between the images is required to obtain similarity.

[0225] In contrast to the prior art, which requires overlap between images in order to mutually align them, the present invention employs correlated temporal behavior between the two sequences, as shown and described with reference to FIGS. 5A to 6C, to resolve both the spatial and the temporal transformations between images of the two sequences. A features of the present invention is the ability to replace the requirement for “coherent appearance”, which is a fundamental assumption in the prior art, with the requirement for “consistent temporal behavior” which is often easier to satisfy, for example by moving the two cameras jointly in space.

[0226] In one application of the present invention, shown and described hereinabove with reference to FIGS. 1A to 1D, the two sequences are produced concurrently by two cameras moving jointly in space. The term ‘concurrently’ here designates that the two sequences are produced at least partially during the same period of time. The concurrency does not require that images, or frames, of the two sequences be produced simultaneously or even at the same rate. ‘Moving jointly’ here means that the two cameras have, for practical purposes, the same center of projection throughout the sequences. This may be realized, for example by fixedly attaching both cameras to the same moving rig. In reality, the centers of projection of the two cameras are not at precisely the same location. However in the mathematical treatment which follows, the centers of projection of both cameras are considered as if they were at the same location. It is further appreciated that the mathematical principles employed in the mathematical treatment are also applicable to situations where the centers of projection of the cameras are clearly not at the same location but are at locations whose spatial relationship is fixed. It is additionally appreciated that the mathematical principles employed in the mathematical treatment are also applicable to situations where the centers of projection of the cameras are clearly not at the same location but are at locations having an at least partially known spatial/temporal relationship.

[0227] In another application of the present invention, shown and described hereinabove with reference to FIGS. 2A to 2D and FIGS. 3A to 3D, the two sequences contain images that are partially overlapping. However the similarity between the images is very low or even nonexistent, namely, no detail of any image of one sequence can be identified in any image of the second sequence.

[0228] In the applications shown and described hereinabove with reference to FIGS. 2A to 2D, the two sequences are produced by cameras employing significantly different zoom. Similar applications may relate to sequences produced by cameras having significantly different magnification or resolution.

[0229] In the applications shown and described hereinabove with reference to FIGS. 3A to 3D, the two sequences are produced by cameras employing different sensing modalities. Typical sensing modalities include: using a photographic camera, such as a still film camera, a digital camera, a video camera or a motion film camera; employing infra-red imaging equipment, radar, x-ray, CAT-scan, MRI or other electromagnetic imaging equipment, acoustic imaging equipment, such as ultrasound, sonar and sub-acoustic geophysical surveillance equipment, satellite remote sensing equipment.

[0230] In yet another application of the present invention shown and described hereinabove with reference to FIGS. 4A to 4D, the two sequences are produced at different times but the two cameras that produce the respective two sequences are moving generally along the same path. The sequences may not have any spatial overlap or may have a partial overlap but still lack a degree of similarity required by the prior art. Such lack of similarity may result from differences in internal camera calibration, such as magnification, zoom and resolution, or from employing different sensing modalities. This lack of similarity may also result from changes in the scene, such as changes caused by the seasons, as illustrated in FIGS. 4A to 4D, or due to differences in visibility between the two sequences.

[0231] The mathematical treatment which follows employs an appreciation that despite there not necessarily being any common static visual information in the two sequences, the image to image dynamics in each of the two sequences are nevertheless related both spatially and temporally. This mathematical treatment utilizes the relationship between the dynamics to correlate the two sequences in time and space, without requiring understanding or interpretation of the features captured by the sequences.

[0232] As will be described hereinbelow in detail, the image to image dynamics preferably are expressed by spatial transformations over time between images in each sequence. The problem of aligning sequences of images in time and space is thus reduced to a problem of determining the relationship between sequences of such transformations in time and in space.

[0233] The motions of the two cameras induce motions to the two sequences. The induced motions may be different for the two sequences but are correlated. Although the motions of the cameras are not known, the correlation between the induced motions serves to correlate between sequences both in time and in space.

[0234] To correlate two images using the image to image dynamics, it is required that:

[0235] (1) Each of the images must be a part of a temporal sequence of images;

[0236] (2) The two sequences must be produced during relative motion between cameras and a scene;

[0237] (3) The optical parameters of the two cameras must not change other than in a known manner throughout the production of the two sequences.

[0238] The mathematical treatment which follows also imposes the following requirement in the examples presented therein:

[0239] (4) The cameras producing the two sequences must have approximately the same center of projection throughout the production of the two sequences.

[0240] The present invention does not require that any single image in one sequence of images have any spatial or visual similarity with any single image in the other sequence. Consequently and in addition, the present invention provides alignment between two images belonging to two sequences of images when the level of similarity between these images is insufficient to provide alignment by employing the prior art.

[0241] The present invention normally does not require any prior internal or external camera calibration at any time.

[0242] Each of the two preferred embodiments of the present invention described hereinbelow is applicable to one of the following two situations:

[0243] (a) A substantial portion of the scene is either planar or distant from the cameras producing the two sequences of images;

[0244] (b) The scene is effectively three-dimensional.

[0245] It is appreciated that the two situations each pertain to all the applications described hereinabove in accordance with FIGS. 1A to 4D.

[0246] As shown and described hereinabove with reference to FIGS. 6A to 6C, simple camera motion may not be sufficient to resolve the spatial and the temporal transformations between images of the two sequences. Therefore several different types of camera motions may be required. Three examples of such camera motion are shown in FIGS. 5A to 5C, it being understood that other, perhaps better, examples of camera motion may exist. An embodiment of the present invention described hereinbelow provides assessment of the required complexity of the motion.

[0247] Reference is now made to FIG. 7, which is a simplified illustration of a complex motion 700 of two cameras 702 and 704, fixed to each other, each camera producing a sequence of images of a portion of a scene 703, the sequences being 706, 708, 710 and 712, 714 and 716 correspondingly, the portions of the scene photographed by the two cameras being non-overlapping.

[0248] Reference is now made to FIG. 8, which is a simplified illustration portions of two sequences 720 and 722 of images taken as shown in FIG. 7, wherein the two sequences are spatially related by a fixed and unknown inter-camera homography and temporally related by a fixed and unknown time shift Δt. The symbols I_(i), T_(i), T′_(i) and H are defined hereinbelow.

[0249] Reference is now made to FIG. 9, which is a functional block diagram of a preferred sequence of steps of implementation of a preferred embodiment of the present invention.

[0250] In step 900 two cameras 910 and 920 are employed to produce two sequences of images 930 and 940.

[0251] Let S be a first sequence of images I_(i) produced by a first camera and let S′ be a second sequence of images I′_(i) produced by a second camera, for example as shown and described in accordance with any of the FIGS. 1A to 8 hereinabove, and wherein S=I_(i), . . . , I_(n+1) and S′=I′_(i), . . . , I′_(n+1).

[0252] The two input sequences have an unknown temporal relation and an unknown spatial relation between them.

[0253] In a preferred embodiment of the present invention the spatial relation may represent the fact that the two cameras are firmly attached to each other.

[0254] In another preferred embodiment of the present invention the two cameras are mounted rigidly on the same device or rig, and moved jointly in space.

[0255] In yet another preferred embodiment of the present invention the spatial relation may represent the fact that the cameras are moving in a generally identical trajectory but at different times.

[0256] In an additional preferred embodiment of the present invention the spatial relation is produced by moving at least one cameras in a generally identical trajectory but in at least one of a different time and a different location, wherein there is a fixed relative position and a fixed relative orientation between the two cameras and wherein the optical properties of each of the two cameras do not change between the images I_(i) and I_(i+1) and between I′_(i) and I′_(i+1).

[0257] In a further preferred embodiment of the present invention the spatial relationship is produced by moving at least one cameras in a generally identical trajectory but in at least one of a different time and a different location, wherein the relative position and a relative orientation between the two cameras may change in a known way and wherein the optical properties of each of the two cameras may change between the images I_(i) and I_(i+1) and between I′_(i) and I′_(i+1) in a known way.

[0258] In a further preferred embodiment of the present invention the spatial relationship is produced by moving at least one camera at different times and/or in different locations, along generally different trajectories, wherein the at least two trajectories are correlated as if they were produced by two cameras that are mounted rigidly on the same device or rig, and moved jointly in space.

[0259] The temporal relation between the two sequences represents the time when the two cameras were in the spatial relation as described hereinabove.

[0260] In a preferred embodiment of the present invention the two sequences are produced by employing synchronization equipment to synchronize between the two cameras. In this case the temporal relation between the two sequences represents the fact that the image I_(i) and the corresponding image I′_(i) are produced together.

[0261] In another preferred embodiment of the present invention the temporal relation between the two sequences represents the fact the image I_(i) and the corresponding image I′_(i) are produced with a fixed time delay between them.

[0262] In yet another preferred embodiment of the present invention the temporal relation applies to image I_(i) and a point in sequence S′ that is between a corresponding I′_(i) and image I′_(i+1).

[0263] In yet another preferred embodiment of the present invention the temporal relation applies to two sequences produced employing two cameras employing two different frame rates.

[0264] In a preferred embodiment of the present invention the temporal relation between the two sequences may represent the fact that the two images are the to be in the same “temporal relationship” if the cameras producing the sequences were in the same location in the same time.

[0265] It is appreciated that temporal relation between sequences may exist even if the temporal relation between images may hold only for virtual images, that is, for images that have not been produced but could have been produced if the camera was producing an image at that time.

[0266] It is also appreciated, that S and S′ are not necessarily the original sequences, but may by subsequences of the original sequences, where subsequence may represent, a portion of the field-of-view, temporal portion of the sequence, sub-sampling of pixels, and sub-sampling of frames.

[0267] The sequences S and S′ may be produced in several methods as described hereinbelow:

[0268] The first and the second camera may have a different 3D orientation and move jointly in space, such as the camera pairs shown in FIG. 7. In a preferred embodiment of the present invention none of the images I_(i) contains any feature contained in any of the images I′_(i), however, there is at least a partial temporal overlap between S and S′.

[0269] In another preferred embodiment of the present invention the first camera and the second camera have at least partially overlapping fields of view, wherein images I_(i) comprises details that are not comprised in the overlapping parts of the corresponding images I′_(j) and wherein the two cameras move jointly in space, such as the camera pair shown and described in accordance with FIGS. 3A to 3D hereinabove.

[0270] In yet another preferred embodiment of the present invention the sequence S and the sequence S′ may be produced by the same camera moving in at least approximately the same pattern in space and at different times.

[0271] Also in another preferred embodiment of the present invention the sequence S and the sequence S′ may be produced by two cameras moving in at least approximately the same pattern in space and at different times.

[0272] It is appreciated that the sequences S and S′ may be produced by any image producing instrument that produces at least two dimensional images of space, such as photographic camera, such as still film camera, digital camera, video camera or motion film camera, infra-red imaging equipment, radar, x-ray, CAT-scan, MRI and other electromagnetic imaging equipment, acoustic imaging equipment, such as ultrasound, sonar and sub-acoustic geophysical surveillance equipment and satellite remote sensing equipment. It is also appreciated that the two sequences S and S′ may be produced by image producing instruments of the same type or of different types.

[0273] It is appreciated that neither of the two sensors has to be calibrated.

[0274] The temporal correspondence can be achieved electronically, for example by employing Genlock, or recovered using the method describe hereinbelow with reference to element 960 of FIG. 9.

[0275] Furthermore, a method for computing temporal relation described hereinbelow can compute temporal relation at sub-frame time units. In this case a temporal relation is computed between a transformation T_(i) and a transformation T′_(j+δ) wherein T_(j+δ) is interpolated from T_(j) and T_(j+1). The sequence of transformations T_(j+δ) applies to virtual images I_(j+δ) wherein in the virtual images were not actually produced by the camera producing image sequence S′, but could have been produced by the camera if the images produced at the appropriate time points and are therefore interpolated representations of the scene.

[0276] Reference is now made to step 990 of FIG. 9. It can now be assumed that the transformations and images are temporally synchronized.

[0277] Let H be a spatial transformation function that transforms between a coordinate system of sequence S and a coordinate system of sequence S′. Applying the transformation H on the sequence S′ results in the content of images I′_(i) in the coordinates of the sequence S, as if the transformed sequence S′ has been produced by the camera that has produced the sequence S. Therefore:

p′=H(p) where p′ is the feature p of I_(i) in the coordinates of I′_(i).

[0278] In one preferred embodiment of the present invention, typically where the two cameras have approximately the same center of projection, H is a 3×3 inevitable matrix.

[0279] Such H is denoted here as a “homography”, the terms collination and 2D projective transformation may be equally used. In this case p and p′ are given in homogeneous coordinates and the equation p′=H(p) becomes p′≅Hp where ≅ denotes equation up to a scale factor.

[0280] In another preferred embodiment of the present invention, typically where the two cameras have a different center of projection and are firmly attached to the same rig H is a 4×4 inevitable Euclidean or inevitable projective matrix.

[0281] However, the two sequences S and S′ do not share sufficient common feature or any other properties of the images. Therefore we cannot compute H from common properties of the images I_(i). Instead H is computed by correlating between properties of the temporal progressions within each sequence

[0282] In a preferred embodiment of the present invention H is computed from the induced frame to frame transformation within each of the sequences S and S′.

[0283] Let T be a first sequence of frame-to-frame transformations T_(i) and let T′ be a second sequence of frame-to-frame transformations T′_(i) wherein T=T₁, . . . , T_(n+1) and T′=T′_(i), . . . , T′_(n+1) and wherein I_(i +1)≅T_(i)I_(i) and I′_(i+1)≅T′_(i)I′_(i).

[0284] In a preferred embodiment of the present invention, a large portion of the scene that is photographed by the two cameras, producing the sequences S and S′, is planar or distant from the cameras. In this case T_(i) and T′_(i) are 3×3 non-singular matrices.

[0285] Let P be a three dimensional point in the planar or distant scene and let p_(i) and p′_(i) be the homogeneous coordinates of the projection of the point P in the images I_(i) and I′_(i), respectively. It is noted that there is no need for P to appear in both or in any of the images I_(i) and I′_(i), that is, within the field of view of the cameras when images I_(i) , or I′_(i) are produced. Let p_(i+1), and p′_(i+1) be the coordinates of the projection of the point P in images I_(i+1) and I′_(i+1) respectively.

[0286] Then:

P _(i+1) ≅T _(i) p _(i) and p′ _(i+1) ≅T′ _(i) p′ _(i)

[0287] and

p′ _(i) ≅Hp _(i) and p′ _(i+1) ≅Hp _(i+1)

[0288] and therefore Eq. (1) is:

HT _(i) p _(i) ≅Hp _(i+1) ≅p′ _(i+1) ≅T′ _(i) p′ _(i) ≅T′ _(i) Hp _(i)

[0289] and therefore Eq. (2) is:

HT _(i)≅T′_(i)H

[0290] This operation is also referred to as “matrix composition”.

[0291] Since H is inevitable then Eq. (3) is:

T′ _(i) =s _(i) HT _(i) H ⁻¹ where s is a frame dependent scale factor.

[0292] Eq.(3) is true for all the images, that is, for any pair of temporally corresponding transformations T_(i) and T′_(i), where i=1, . . . , n. This equation shows that there is a similarity relation between the two matrices T_(i) and T′_(i) up to a scale factor. A matrix A is the to be “similar” to a matrix B if there exists an inevitable matrix M such that A=MBM⁻¹. The term “conjugate matrices” can be used instead of “similar matrices”.

[0293] Let eig(A)=[λ₁, λ₂, μ₃]^(t) be a 3×1 vector containing, in decreasing order, eigenvalues of a 3×3 matrix A. □^(t) denotes the transpose vector. It is known in the art, as described for example in C. E. Pearson (ed.). Handbook of applied mathematics Second Edition. Van Nostrand Reinhold Company, New York, 1983, pp 898, that: If A and B are similar matrices then they have the same eigenvalues: eig(A)=eig(B), and, the eigenvalues of a scaled matrix are scaled: eig(sA)=s(eig(A)).

[0294] Using these two facts and Eq. (3) we obtain Eq. (4) hereinbelow:

eig(T′ _(i))=s _(i)eig(T _(i)) where si is the scale factor defined by Eq. (3).

[0295] Equation (4) implies that eig(T_(i)) and eig(T′_(i)) are “parallel”. This gives rise to a measure of similarity between two matrices T_(i) and T′_(i), denoted by sim(T_(i), T′_(i)) and presented in Eq. (5) hereinbelow: ${{{sim}\left( {T_{l},T_{l}^{\prime}} \right)} = \frac{{{eig}\left( T_{l} \right)}^{i}\quad {{eig}\left( T_{l}^{\prime} \right)}}{{{{eig}\left( T_{l} \right)}}{{{eig}\left( T_{l}^{\prime} \right)}}}},$

[0296] where ∥·∥ is the vector norm.

[0297] For each pair of the temporally corresponding transformations T_(i) and T′_(i), in the sequences S and S′ the eigenvalues eig(T_(i)) and eig(T′_(i)) are first computed. The scale factor s_(i) which relates the eigenvalues eig(T_(i)) and eig(T′_(i)) is then estimated from Eq. (4). Eq. (4) is a set of three equations with one unknown and can be solved using least squares minimization. Alternatively, the input homographies T_(i) and T′_(i) can be normalized to have determinant equal 1 and to avoid the need to compute s_(i) .

[0298] Once s_(i) is estimated, Eq. (3) or Eq. (2) can be rewritten in the form of Eq. (6) hereinbelow:

s _(i) HT _(i) −T′ _(i) H=0

[0299] Equation (6) is linear in the unknown components of H. Rearranging the components of H in a 9×1 column vector {right arrow over (h)}=[H₁₁H₁₂H₁₃H₂₁H₂₂H₂₃H₃₁H₃₂H₃₃]^(t), Eq. (6) can be rewritten as a set of linear equations in h in the form of Eq. (7) hereinbelow:

M_(i){right arrow over (h)}={right arrow over (0)}

[0300] wherein M_(i) is a 9×9 matrix defined by T_(i), T′_(i) and s_(i): $M_{i} = \begin{bmatrix} {{s_{i}T_{i}^{i}} - {T_{i_{11}}^{\prime}I}} & {{- T_{i_{12}}^{\prime}}I} & {{- T_{i_{13}}^{\prime}}I} \\ {{- T_{i_{21}}^{\prime}}I} & {{s_{i}T^{i}} - {T_{i_{22}}^{\prime}I}} & {{- T_{i_{23}}^{\prime}}I} \\ {{- T_{i_{31}}^{\prime}}I} & {{- T_{i_{32}}^{\prime}}I} & {{s_{i}T^{i}} - {T_{i_{33}}^{\prime}I}} \end{bmatrix}_{9 \times 9}$

[0301] and wherein I is the 3×3 identity matrix.

[0302] Eq. (7) implies that each pair of corresponding transformations T_(i) and T′_(i) contributes 9 linear constrains in the unknown homography H (i.e., {right arrow over (h)}).

[0303] The constraints from all the transformations T₁, . . . , T_(n) and T′₁, . . . , T′_(n) can be combined into a single set of linear equations in {right arrow over (h)} provided by Eq (8) hereinbelow:

A{right arrow over (h)}={right arrow over (0)} where A is a 9n×9 matrix: $A = \begin{bmatrix} M_{1} \\ \vdots \\ M_{n} \end{bmatrix}$

[0304] Equation (8) is a homogeneous set of line equations in {right arrow over (h)} that can be solved in a variety of ways. In a preferred embodiment of the present invention {right arrow over (h)} is solved by computing the eigenvector which corresponds to the smallest eigenvalue of the matrix A^(t)A.

[0305] In another preferred embodiment of the present invention the scene for which the sequences S and S′ have been produced is neither planar nor distant. In this case the temporal progression between any two consecutive images I_(i) and I_(i+1) is described by a fundamental matrix F_(i).

[0306] The fundamental matrix Fdefines the relation between corresponding image points p_(i) so that:

[0307] if p_(i) in I_(i) and p_(i+1) in I_(i+1) are corresponding image points, then

[0308] p^(t) _(i+1)F_(i)p_(i)=0

[0309] wherein F_(i) are each a 3×3 matrix of rank 2.

[0310] Let F be a sequence of fundamental matrices F_(i) wherein F=F₁, . . . , F_(n) Respectively, the temporal progression between any two consecutive images I′_(i) and I′_(i +1) is described by F′_(i), wherein F′=F′₁, . . . , F′_(n).

[0311] Many methods for computing fundamental matrices are known in the prior art. One such method is taught by P. H. S. Torr and A. Zisserman in “Feature based methods for structure and motion estimation” in the proceedings of the Vision Algorithms Workshop pages 279-290, Corfu, 1999. Another method is taught by Z. Zhang, R. Deriche, O. Faugeras, and Q. Luong in “A robust technique for matching two uncalibrated images through the recovery of the unknown epipolar geometry” in the journal of Artificial Intelligence, 78:87-119, 1995.

[0312] The two sequences S and S′ may not share sufficient common feature or any other properties of the images. Therefore the spatial and the temporal relations between the sequences S and S′ are computed by correlating between properties of the temporal progressions F=F₁, . . . , F_(n) and F′₁, . . . , F′_(n) within each sequence

[0313] It is appreciated that neither of the two cameras has to be calibrated.

[0314] It is appreciated that because the two cameras share the same center of projection the inter-camera transformation remains a homography H although the relations within each sequence are characterized by fundamental matrices,

[0315] In a preferred embodiment of the present invention, where the scene for which the sequences S and S′ have been produced is neither planar nor distant, H is computed from properties of the temporal progression output as expressed by the sequences F and F′ of the matrices F_(i) and F′_(i).

[0316] Each fundamental matrix F, can be decomposed into a homography+epipole as described by Eq. (9) hereinbelow:

F_(i) =[e _(i)]_(x) T _(i) wherein e_(i) is the epipole relating frames I_(i) and I_(i+1);

[0317] wherein the matrix T_(i) is the induced homography from I_(i) to I_(i+1) via any plane, real or virtual; and

[0318] wherein [·]_(x) is the cross product matrix [v]_(x) {right arrow over (w)}={right arrow over (v)}×{right arrow over (w)}.

[0319] The homographies, T₁, . . . , T_(n) and T′₁, . . . , T′_(n), and the epipoles e₁, . . . , e_(n) and e′₁, . . . , e′_(n), impose separate constraints on the inter-camera homography H. These constraints can be used separately or jointly to recover H as described. hereinbelow.

[0320] (i) Homography-Based Constraints:

[0321] The homographies T₁, . . . , T_(n) and T′₁, . . . , T′_(n) extracted from the fundamental matrices F₁, . . . , F_(n) and F′₁, . . . , F′_(n), respectively may correspond to different three dimensional planes. In order to apply the algorithm described above for the case of a planar or a distant scene, using these homographies, we have to impose plane-consistency across the two sequences, to guarantee that temporally corresponding homographies correspond to the same plane in the three dimensional world.

[0322] In a preferred embodiment of the present invention the “Plane+Parallax” method which is well known in the prior art, is used to impose plane-consistency across and within the two sequences T₁, . . . , T_(n) and T′₁, . . . , T′_(n). The Plane+Parallax method describes the image-to-image transformation using two components: homography and residual parallax. The homography is associated with a selected plane and relates points on this plane between the two images. The parallax component describes the residual displacement of off-plane points. The “Plane+Parallax” method requires that a real physical planar surface be visible in all images I_(i) and I′_(i).

[0323] One method for computing a Plane+Parallax transformation is taught by M. Irani, P., Anandan and D. Weinshall in “From reference frames to reference planes: Multi-view parallax geometry and applications” in the proceedings of the European Conference on Computer Vision, Freiburg, June 1998.

[0324] Another method for computing a Plane+Parallax transformation is taught by R. Kumar, P. Anandan and K. Hanna in “Direct recovery of shape from multiple views: parallax based approach” in the proceedings of the International Conference on Pattern Recognition, 1994.

[0325] Yet another method for computing a Plane+Parallax transformation is taught by Harpreet Sawhney in “3D geometry from planar parallax” in the proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, June 1994.

[0326] Another method for computing a Plane+Parallax transformation is taught by A. Shashua and N. Navab in “Relative affine structure: Theory and application to 3D reconstruction from perspective views” in the proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 483-489, Seattle, Wash., June 1994.

[0327] The homography part of the Plane+Parallax transformation is then used in the same manner as in the planar or distant case described hereinabove.

[0328] In another preferred embodiment of the present invention the “threading” method, as described for example in S. Avidan and A. Shashua. Threading fundamental matrices. In European Conference on Computer Vision, 1998, which is also well known in the prior art, is used to impose plane-consistency across and within the two sequences T₁, . . . , T_(n) and T′₁, . . . , T′_(n). The “threading” method can impose plane-consistency within each sequence, even if no real physical plane is visible in any of the frames.

[0329] It is appreciated that there are other methods in the prior art for computing a consistent set camera matrices. It is appreciated that the term camera matrix refers to a 4×3 matrix, which is comprised of a 3×3 left minor. matrix and a 1×3 vector, wherein the 3×3 left minor matrix represents a 3×3 homography. The consistency of the camera matrices imposes plane-consistency on the 3×3 homographies.

[0330] In a preferred embodiment of the present invention plane consistency between the two sequences is provided by applying the threading method on each of the two sequences S and S′, by initiating the threading method at frames which are known to simultaneously view the same real plane in both sequences.

[0331] It is appreciated that the two cameras can see different portions of the plane, allowing for non-overlapping fields of view, and need not see the plane at any of the other images.

[0332] (ii) Epipole-Based Constraints:

[0333] In a preferred embodiment of the present invention the homography H is computed from epipoles e_(i) and e′_(i), which are computed from the fundamental matrices F_(i) and F′_(i). Given two images I_(i) and I_(i+1), an epipole denotes the spatial location of the center of projection of the camera for image I_(i+1) in the coordinates system of image I_(i). The fundamental matrices F₁, . . . , F_(n) and F′₁, . . . , F′_(n) provide a list of epipoles e₁, . . . , e_(n) and e′₁, . . . , e′_(n), wherein an epipole e₁ is the null space of a fundamental matrice F_(i) and an epipole e′_(i) is the null space of a fundamental matrice F′_(i).

[0334] It is appreciated that the epipoles e_(i) and e′_(i) can be computed by other methods than from the null space of the fundamental matrices F_(i.) and F′_(i.) respectively. There are many other methods known in the prior art to find epipoles between two images.

[0335] The epipoles e_(i) and e′_(i) are uniquely defined and therefore there is no issue of plane consistency. Since the two cameras have the same center of projection, then for any pair of images e_(i) and e′_(i) H satisfies the equation:

e′_(i)≅He_(i),

[0336] which yields Eqs. (10a and 10b) hereinbelow: $\begin{matrix} {{\left( e_{i}^{\prime} \right)_{x} = \frac{\left\lbrack {h_{1}h_{2}h_{3}} \right\rbrack e_{i}}{\left\lbrack {h_{7}h_{8}h_{9}} \right\rbrack e_{i}}},} & {and} & {\left( e_{i}^{\prime} \right)_{y} = {\frac{\left\lbrack {h_{4}h_{5}h_{6}} \right\rbrack e_{i}}{\left\lbrack {h_{7}h_{8}h_{9}} \right\rbrack e_{i}}.}} \end{matrix}$

[0337] Multiplying by the denominator and rearranging terms yields two new linear constrains on H for every pair of corresponding epipoles e_(i) and e′_(i) as described in Eq. (11) hereinbelow: ${\begin{bmatrix} e_{i}^{i} & {\overset{\_}{0}}^{i} & {\left( e_{i}^{\prime} \right)_{x}e_{i}^{i}} \\ {\overset{\_}{0}}^{i} & e_{i}^{i} & {\left( e_{i}^{\prime} \right)e_{i}^{i}} \end{bmatrix}_{2 \times 9}\overset{\rightarrow}{h}} = 0$

[0338] where {right arrow over (0)}^(t)=[0,0,0].

[0339] Therefore, every pair of temporally corresponding epipoles e_(i) and e′_(i) imposes two linear constraints on H. The two sequences e₁, . . . , e_(n) and e′₁, . . . , e′_(n) provide a homogeneous linear system of 2n equations, wherein Eq(11) is one pair of these 2n equations.

[0340] The system of 2n equations can be solved for H in a variety of ways.

[0341] In a preferred embodiment of the present invention {right arrow over (h)} is solved by computing the eigenvector which corresponds to the smallest eigenvalue. Theoretically, four pairs of corresponding epipoles e_(i) and e′_(i) are sufficient, provided that no three epipoles are on the same line.

[0342] Alternatively, H can be solved by adding the system of 2n equations to the set of linear equations in Eq. (8) which are imposed by the homographies.

[0343] Reference is now made to step 960 of FIG. 9.

[0344] In yet another preferred embodiment of the present invention the sequences S and S′ are not temporally synchronized. Namely, the image I_(i) in sequence S corresponds to image I′_(i+Δt) in sequence S′ and Δt is unknown. Therefore the transformation T_(i) corresponds to transformation T_(i+Δt) and not to T′_(i). If time stamping, or similar additional information, is available for each image I_(i) and I′_(i) then synchronization can be recovered. When there is no additional information to recover the synchronization, the synchronization can be recovered in using the method hereinbelow.

[0345] Given two unsynchronized sequences of transformations T₁, . . . , T_(n) and T′₁, . . . , T′_(m), wherein T_(i) and T′_(i+Δt) are temporally corresponding transformations. According to Eq. (4) eig(T_(i))∥eig(T′_(i+Δt)) meaning that the 3×1 vectors of eigenvalues are parallel, namely there is an angle of 0° between the two vectors. Therefore the similarity measure sim(T_(t) _(i) ,T′_(t′) _(i+Δt) ) of Eq. (5) is equal to 1, corresponding to cos(0). All pairs of temporally corresponding transformations T_(i) and T_(i+Δt), must simultaneously satisfy this constraint. When the unknown temporal shift Δt can be modeled by a set of parameters Δt_(i)=f(i,a_(i) . . . a_(n)), then the parameters can be recovered by maximizing the following objective function presented hereinbelow as Eq. (12): ${{SIM}\left( {a_{l},\ldots \quad,a_{n}} \right)} = {\sum\limits_{i}{{sim}\left( {T_{i},T_{i + {\Delta \quad t_{i}}}} \right)}^{2}}$

[0346] For example, when the unknown Δt is a simple global temporal shift, it can be recovered by maximizing the following objective function presented hereinbelow as Eq. (12.a): ${{SIM}\left( {\Delta \quad t} \right)} = {\sum\limits_{i}{{sim}\left( {T_{i},T_{l + {\Delta \quad t}}} \right)}^{2}}$

[0347] In a preferred embodiment of the present invention the maximization is performed by an exhaustive search over a finite range of valid time shifts Δt.

[0348] Alternatively, to address larger temporal shifts, a hierarchical search is applied. Coarser temporal levels are constructed by composing transformations to obtain fewer transformation between more distant frames.

[0349] In still another preferred embodiment of the present invention the images in sequence S are produced at a different rate than the images of sequence S′. For example, when sequence S is produced by an NTSC camera at 30 frame per second and sequence S′ is produced by a PAL camera at 25 frames per second. The ratio between the rate of recording of the two sequences S and S′ is fixed and in the case of PAL and NTSC cameras it is 25:30=5:6. Therefore, the objective function that should be maximized for an PAL-NTSC pair of sequences as presented by Eq. (13) hereinbelow: ${{SIM}\left( {\Delta \quad t} \right)} = {\sum\limits_{i}{{sim}\left( {T_{5i}^{5{({i + 1})}},T_{{6i} + {\Delta \quad t}}^{{{\prime 6}{({i + 1})}} + {\Delta \quad t}}} \right)}^{2}}$

[0350] where T_(i) ^(j) is the transformation from frame I_(i) to frame I_(j).

[0351] PAL and NTSC video cameras produce each image as pair of fields, wherein the first field comprises the odd lines of the image and the second field comprises the even lines of the picture. The fields are produced in a rate that is double the rate of the images, or frames, that is at 60 and 50 fields per second respectively. The method described above with respect to Eq. (12.a) can recover synchronization to the field level. Sub-field accuracy can be recovered by interpolating the values of SIM(Δt) obtained at discrete time shifts.

[0352] In a preferred implementation of the present invention the transformations are interpolated according to the computed temporal correspondence and SIM(Δt) is re-estimated, in an iterative manner, to increase the temporal accuracy.

[0353] In order to solve H it is required to have a sufficient number N_(min) of corresponding pairs of frame-to-frame transformations T_(i) and T′_(i).

[0354] In a preferred embodiment of the present invention the number N_(min) is assessed by examining via the similarity equation Eq. (3) the number of constraints imposed on H by a single pair of transformations T_(i) and T′_(i).

[0355] The scale factor s_(i) can be extracted directly from T_(i) and T′_(i) as described hereinabove with reference to element 950 of FIG. 9 and therefore can be omitted from Eq. (3). Therefore, the number of constraints imposed on H by a single pair of transformations via the similarity equation Eq. (3) can be estimated by examining the number of constraints imposed on H by an equation of the form G=HBH⁻¹ where B=T_(i) and G=T′_(i). A general analysis of matrix equations of the form GH=HB may be found in The theory of matrices. Chapter VIII, by F. R. Gantmakher from Chelsea Pub., New York, 1959.

[0356] The following notations are used hereinbelow:

[0357] denote by λ₁, λ₂, λ₃ the eigenvalues of the matrix B in decreasing order (|λ₁|≧|λ₂|≧|λ₃|);

[0358] denote by {right arrow over (u)}_(b1), {right arrow over (u)}_(b2), {right arrow over (u)}_(b3) the corresponding eigenvectors with unit norm (∥{right arrow over (u)}_(b1)∥=∥{right arrow over (u)}_(b2)∥=∥{right arrow over (u)}_(b3)∥);

[0359] denote by r_(j) the algebraic multiplicity of the eigenvalue λ_(j); and

[0360] denote by V_(j={{right arrow over (v)}∈R) ^(n):B{right arrow over (v)}=λ_(j){right arrow over (v)}} the corresponding eigen subspace.

[0361] It is noted that:

[0362] If λ₁?λ₂?λ₃ then the algebraic multiplicity of all eigenvalues is 1 (r_(j)=1);

[0363] If λ₁=λ₂?λ₃ then the algebraic multiplicity of λ₁ and λ₂ is 2, and the algebraic multiplicity of λ₃ is 1 (r₁=r₂=2 and r₃=1); and that

[0364] If λ₁=λ₂=λ₃ then the algebraic multiplicity of λ₁, λ₂, and λ₃ is 3 (r₁=r₂=r₃=3).

[0365] Similar matrices, also known as conjugate matrices, such as B and G, have the same eigenvalues but different eigenvectors. The eigenvectors of the similar matrices are related by H. If ub is an eigenvector of B with corresponding eigenvalue λ, then Hu_(b) is an eigenvector of G with the same eigenvalue λ so that G(Hu_(b))=λ(Hu_(b)). The same applies for eigen subspaces, wherein if V is an eigen subspace of B corresponding to an eigenvalue λ, then H(V) is an eigen subspace G with the same eigenvalue λ. The number of constraints imposed on H by B and G is therefore investigated according to the dimensionality of the eigen subspaces of B and G. Let V be the eigen subspace corresponding to an eigenvector u_(b) of B. Three possible cases are valid, one case for each possible dimensionality of V, i.e., dim(V)=1, 2, 3.

dim(V)=1.   Case I

[0366] This case typically occurs when all three eigenvalues are distinct. The case can also occur when some eigenvalues have algebraic multiplicity of two or three. In all these cases, V is spanned by the single eigenvector u_(b). Similarly H(V) is spanned by the eigenvector u_(g) of G. Therefore Eq. (13):

Hu_(b)=au_(g)

[0367] wherein α is an unknown scale factor

[0368] Eq. (13) provides three linear equations in Hand one new unknown a and therefore Eq. (13) provides two new linearly independent constrains on H.

dim(V)=2.   Case II

[0369] This case typically occurs in one of the following two cases:

[0370] (a) when there exists an eigenvalue with algebraic multiplicity two; or

[0371] (b) when there is only one eigenvalue with algebraic multiplicity three.

[0372] However, the eigen subspace spanned by all eigenvectors has dimensionality of two. For example, a homography defined by pure shift (Δx, Δy) has the form: $H = {\begin{bmatrix} 1 & 0 & {\Delta \quad x} \\ 0 & 1 & {\Delta \quad y} \\ 0 & 0 & 1 \end{bmatrix}.}$

[0373] This matrix has a single eigenvalue λ₁=λ₂=λ₃=1 with algebraic multiplicity three. The corresponding eigen subspaces has dimensionality 2. It is spanned by two linearly independent eigenvetors [1,0,0]^(t) and [0,1,0]^(t).

[0374] When dim(V)=2 the two eigenvectors span V, such that, for example, w.l.o.g., u_(b1) and u_(b2). Therefore every linear combination of u_(b1) and u_(b2) is also an eigenvector of B with the same eigenvalues. Similarly, every linear combination of u_(g1) and u_(g2) is an eigenvector of G with the same eigenvalue. Therefore Eq. (14):

Hu _(hj) =α _(j) u _(g1)+β_(j) u _(g2) where α_(b) and β_(j) are unknown scalars (j=1,2)

[0375] Therefore, each of the two eigenvectors ub₁ and ub₂ provides 3 linear equations and 2 new unknowns. Therefore, together the two eigenvectors u_(b1) and u_(b2) provide 2 new linear constraints on H.

dim(V)=3.   Case III

[0376] In this case any vector is an eigenvector and all the eigenvector have the same eigenvalues λ. This is the case when B≅G≅λI are the identity transformation up to a scale factor, which means that there is no motion. In this case B and G provide no additional constraints on H.

[0377] The number of constraints imposed on H were counted hereinabove for a single eigen subspace. In order to count the total number of linear constraints that B and G impose on H every possible combination of eigen subspaces is analyzed according to the algebraic multiplicity of the eigenvalues. There are three such combinations:

[0378] 1. λ_(i)≠λ_(j)≠λ_(k), which implies that:

[0379] V_(i)≠V_(j)≠V_(k:) and

[0380] dim(V_(i)) dim(V_(j))=dim(V_(k))=1.

[0381] 2. λ_(i)=λ_(j)≠λ_(k), which implies that V_(i)=V_(j)≠V_(k). There are two such cases:

[0382] (a) dim(V_(i)=V_(j))=2 and dim(V_(k))=1.

[0383] (b) dim(V_(i)=V_(j))=1 and dim(V_(k))=1.

[0384] 3. λ_(i)=λ_(j)=λ_(k)

[0385] In this case there is only a single eigen subspace V=V_(i)=V_(j)=V_(k), which dimensionality may 1, 2, or 3.

[0386] The following table summarizes the number of linearly independent constraints of each of the above cases: Eigenvalues # of Linearly Algebraic Eigen Subspaces independent Case Multiplicity dimensionality constraints (1) λ_(i ≠ λ) _(j) ≠ λ_(k) |V_(i)| = |V_(j)| = |V_(k)| = 1 6 (2.a) λ_(i = λ) _(j) ≠ λ_(k) |V_(i) = V_(j)| = 2, |V_(k)| = 1 4 (2.b) λ_(i = λ) _(j) ≠ λ_(k) |V_(i) = V_(j)| = 1, |V_(k)| = 1 4 (3.a) λ_(i = λ) _(j) = λ_(k) |V_(i) = V_(j) = V_(k)| = 1 2 (3.b) λ_(i = λ) _(j) = λ_(k) |V_(i) = V_(j) = V_(k)| = 2 2 (3.c) λ_(i = λ) _(j) = λ_(k) |V_(i) = V_(j) = V_(k)| = 3 0

[0387] Therefore, when B and G have either two or three distinct eigenvalues, which is typical of general frame-to-frame transformations, then two independent pairs of transformations suffices to uniquely determine H, since each pair of transformations imposes 4 to 6 linearly independent constrains, and, according to the prior art, 8 independent linear constrains suffice to uniquely resolve H, up to an arbitrary scale factor. In a preferred embodiment of the present invention all available constrains from all pairs of transformation, for increased numerical stability.

[0388] In a preferred embodiment of the present invention two cameras employed to produce two input sequences, preferably several seconds long to provide significant motion.

[0389] Referring to step 950, a frame-to-frame input transformations, T₁, . . . , T_(n) and T′₁, . . . , T′_(n.) are preferably extracted, for the case of the planar or distant scene, using the method described in, for example, M. Irani, B. Rousso and S. Peleg. Computing occluding and transparent motions. International Journal of Computer Vision, 12(1):5-16, January 1994.

[0390] Reference is now made to step 970 of FIG. 9. Step 970 comprises methods of robust statistics to enhance the accuracy of the transformations T_(i) and T′_(i). In a preferred embodiment of the present invention step 970 comprises two optional methods:

[0391] (a) Outlier rejection, designated by reference numeral 972; and

[0392] (b) Coordinate renormalization, designated by reference numeral 974.

[0393] In step 972 inaccurate frame-to-frame transformations T_(i) are preferably pruned out by employing any of the two outlier detection mechanisms known in the prior art as described hereinbelow:

[0394] (i) In a preferred embodiment of the present invention, the transformation between successive frames within each sequence are computed in both directions. The distance of the composed matrix T_(i)T_(i) ^(Reverse) from the identity matrix in the image space is computed, in terms of the maximal residual misalignment of pixels. $\begin{matrix} {{{Reliability}\left( T_{i} \right)} = {\max\limits_{p \in l_{i}}{{{{T_{i}T_{i}^{Reverse}p} - p}}.}}} & (15) \end{matrix}$

[0395] (ii) Alternatively, the similarity criterion of Eq. (5) is employed to verify the degree of “similarity” between T_(i) and T′_(i). An unreliable pair of transformations can thus be pruned out.

[0396] In step 974, optionally, any one of two methods of coordinate renormalization known in the prior art is used as described hereinbelow:

[0397] (a) The input matrices are re-normalized to increase the numerical stability, as described for example in Richard L. Hartley. In Defence of the 8-point Algorithm. In Pattern Recognition and Machine Intelligence 19 (6) June pages 580-593 1997.

[0398] (b) Input matrices are normalized so that the rows of M has approximately the same norm, using the heuristic provided in for example, Gene Golub and Charles Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore and London, pp. 123-127, 1989.

[0399] Reference is now made to step 980 of FIG. 9.

[0400] In a preferred embodiment of the present invention, when the frame-to-frame transformations are too. small, temporal sub-sampling of the sequences can provide more significant transformations between successive frames. Preferably, temporal sub-sampling is done after recovering the temporal synchronization, in order to guaranty that temporally corresponding frames are sampled from the two video sequences.

[0401] In another preferred embodiment of the present invention the three dimensional joint motions of the two cameras are planned in advance to increase the accuracy of the computed result.

[0402] For example, in a preferred embodiment of the present invention input data are sequences of transformation T_(i) and T′_(i). The transformation T_(i) and T′_(i) are extracted from two video sequences using one of a variety of algorithms provided in the prior art. The reliability of the input data also depends on the specific algorithm used to extract the input transformations. Employing a rough approximation to the accuracy. of the different transformations T_(i) and T′_(i) it is possible to analyze the combinations of the transformations T_(i) and T′_(i) that participate in the matrix M (Eq.7). Hence by analyzing the pure 6 motions, comprising thee translation and three rotations, the stability of the derived equations can be predicted. It is appreciated that a higher stability of the derived equations results in a higher accuracy of the alignment between the sequences. For example, for the method described, for example, in M. Irani, B. Rousso and S. Peleg. Computing occluding and transparent motions. International Journal of Computer Vision, 12(1):5-16, January 1994, the accuracy of the projective parameters T_(3,1) and T_(3,2) is poor, the accuracy of the translation parameters T_(1,3) and T_(2,3) is good, and the. other parameters have fair accuracy. Therefore it is predicted that rotation within the image plane produces the most reliable set of equations.

[0403] It is appreciated that various features of the invention which are, for clarity, described in the contexts of separate embodiments may also be provided in combination in a single embodiment. Conversely, various features of the invention which are, for brevity, described in the context of a single embodiment may also be provided separately or in any suitable subcombination.

[0404] It will be appreciated by persons skilled in the art that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention is defined only by the claims that follow: 

1. A method for computing at least one of spatial and temporal relationships between at least first and second sequences of representations having respective first and second temporal progressions, the method comprising: employing said first and second temporal progressions to obtain at least one of said spatial and temporal relationships.
 2. A method for computing at least one of spatial and temporal relationships between at least first and second sequences of representations having respective first and second temporal progressions, the method comprising: employing only said first and second temporal progressions to obtain at least one of said spatial and temporal relationships.
 3. A method according to claim 1 or claim 2 and also comprising: computing said first and second temporal progressions which are then employed to obtain at least one of said spatial and temporal relationships.
 4. A method according to any of the preceding claims and wherein said representations comprise visual representations.
 5. A method according to any of the preceding claims and wherein said representations comprise images.
 6. A method according to any of the preceding claims and wherein said representations comprise at least three-dimensional objects.
 7. A method according to any of the preceding claims and wherein said employing obtains said spatial relationship.
 8. A method according to any of the preceding claims and wherein said employing obtains said temporal relationship.
 9. A method according to any of the preceding claims and wherein said employing obtains said spatial relationship and said temporal relationship
 10. A method according to any of the preceding claims and wherein said employing obtains said at least one of spatial and temporal relationships in the absence of a spatial overlap between said representations
 11. A method according to any of the preceding claims and wherein said employing obtains said at least one of spatial and temporal relationships in the absence of common spatial information between said representations.
 12. A method according to any of the preceding claims and wherein said employing obtains said at least one of spatial and temporal relationships in the absence of common information between individual ones of said representations belonging to different ones of said at least first and second sequences.
 13. A method according to any of the preceding claims and wherein said employing obtains said at least one of spatial and temporal relationships in the absence of common information between any individual ones of said representations belonging to different ones of said at least first and second sequences.
 14. A method according to any of the preceding claims and wherein said spatial relationship comprises at least one parameter of a geometric transformation between said at least first and second sequences of representations.
 15. A method according to claim 14 and wherein said spatial relationship includes a 2-dimensional projective transformation.
 16. A method according to claim 14 and wherein said spatial relationship includes a 3-dimensional projective transformation.
 17. A method according to claim 14 and wherein said spatial relationship includes a fundamental matrix.
 18. A method according to claim 14 and wherein said spatial relationship includes a 2-dimensional parametric transformation.
 19. A method according to claim 14 and wherein said spatial relationship includes an at least 3-dimensional parametric transformation.
 20. A method according to claim 14 and wherein said spatial relationship includes a 2-dimensional non-parametric transformation.
 21. A method according to claim 14 and wherein said spatial relationship includes an at least 3-dimensional non-parametric transformation.
 22. A method according to any of claims 14-21 and wherein said spatial relationship comprises a spatial relationship between individual ones of said representations belonging to different ones of said at least first and second sequences.
 23. A method according to any of claims 14-21 and wherein said spatial relationship comprises a spatial relationship between individual ones of said representations belonging to different ones of said at least first and second sequences, at least one of said individual ones of said representations being an interpolated representation.
 24. A method according to any of claims 14-21 and wherein said spatial relationship comprises a spatial relationship between individual ones of said representations belonging to different ones of said at least first and second sequences, one of said individual ones of said representations being an interpolated representation and the other of said individual ones of said representations being a non-interpolated representation.
 25. A method according to any of the preceding claims and wherein said temporal relationship comprises at least one parameter of a temporal transformation between said at least first and second sequences of representations.
 26. A method according to claim 25 and wherein said temporal relationship includes a time shift between said at least first and second sequences of representations.
 27. A method according to claim 25 and wherein said temporal relationship includes an affine transformation in time.
 28. A method according to claim 25 and wherein said temporal relationship includes a parametric transformation in time.
 29. A method according to claim 25 and wherein said temporal relationship includes a non-parametric transformation in time.
 30. A method according to any of claims 25-29 and wherein said temporal relationship comprises a temporal relationship between individual ones of said representations belonging to different ones of said at least first and second sequences.
 31. A method according to any of claims 25-29 and wherein said temporal relationship comprises a temporal relationship between individual ones of said representations belonging to different ones of said at least first and second sequences, at least one of said individual ones of said representations being an interpolated representation.
 32. A method according to any of claims 25-29 and wherein said temporal relationship comprises a temporal relationship between individual ones of said representations belonging to different ones of said at least first and second sequences, one of said individual ones of said representations being an interpolated representation and the other of said individual ones of said representations being a non-interpolated representation.
 33. A method according to any of claims 23, 24, 31 and 32 and wherein said interpolated representation is interpolated in time.
 34. A method according to any of claims 23, 24, 31, 32 and 33 and wherein said interpolated representation is interpolated in space.
 35. A method according to any of the preceding claims and wherein said first and second temporal progressions comprise ordered intra-sequence representation-to-representation transformations.
 36. A method according to any of the preceding claims and wherein said first and second temporal progressions comprise ordered intra-sequence representation-to-representation transformations resulting from relative motion between sensors and a scene.
 37. A method according to either of claims 35 and 36 and wherein said intra-sequence representation-to-representation transformations include 2-dimensional projective transformations.
 38. A method according to either of claims 35 and 36 and wherein said intra-sequence representation-to-representation transformations include 3-dimensional projective transformations.
 39. A method according to either of claims 35 and 36 and wherein said intra-sequence representation-to-representation transformations include fundamental matrices.
 40. A method according to either of claims 35 and 36 and wherein said intra-sequence representation-to-representation transformations include 2-dimensional parametric transformations
 41. A method according to either of claims 35 and 36 and wherein said intra-sequence representation-to-representation transformations include at least 3-dimensional parametric transformations
 42. A method according to either of claims 35 and 36 and wherein said intra-sequence representation-to-representation transformations include 2-dimensional non-parametric transformations
 43. A method according to either of claims 35 and 36 and wherein said intra-sequence representation-to-representation transformations include at least 3-dimensional non-parametric transformations
 44. A method according to either of claims 35 and 36 and wherein said intra-sequence representation-to-representation transformations include camera matrices.
 45. A method according to any of the preceding claims and wherein said employing comprises: correlating said first and second temporal progressions.
 46. A method according to any of the preceding claims and wherein said employing comprises: equating properties of said first temporal progression and said second temporal progression.
 47. A method according to any of the preceding claims and wherein said employing comprises: correlating properties of said first temporal progression and said second temporal progression.
 48. A method according to any of the preceding claims 35-47 and wherein said employing comprises: equating a sequential application of at least one of said intra-sequence representation-to-representation transformations of said first temporal progression and an unknown said spatial relationship between said at least first and second sequences with a sequential application of said unknown spatial relationship between said at least first and second sequences and at least one of said intra-sequence representation-to-representation transformations of said second temporal progression.
 49. A method according to any of the preceding claims 35-47 and wherein said employing comprises: equating a composition of at least one of said intra-sequence representation-to-representation transformations of said first temporal progression and an unknown said spatial relationship between said at least first and second sequences with a composition of said unknown spatial relationship between said at least first and second sequences and at least one of said intra-sequence representation-to-representation transformations of said second temporal progression.
 50. A method according to any of the preceding claims 35-47 and wherein said employing comprises: obtaining an unknown said spatial relationship between said at least first and second sequences by equating a sequential application of at least one of said intra-sequence representation-to-representation transformations of said first temporal progression and said unknown spatial relationship between said at least first and second sequences with a sequential application of said unknown spatial relationship between said at least first and second sequences and at least one of said intra-sequence representation-to-representation transformations of said second temporal progression.
 51. A method according to any of claims 46-50 and wherein equating includes equating up to a scale factor.
 52. A method according to any of claims 35-51 and wherein said intra-sequence representation-to-representation transformations include multiple simple motions taking place at least partially at different times.
 53. A method according to any of claims 35-52 and wherein said intra-sequence representation-to-representation transformations include multiple combinations of multiple simple motions taking place at least partially at different times.
 54. A method according to any of claims 35-53 and wherein said intra-sequence representation-to-representation transformations include multiple complex motions taking place at least partially at different times.
 55. A method according to any of claims 35-54 and wherein said intra-sequence representation-to-representation transformations include multiple combinations of multiple complex motions taking place at least partially at different times.
 56. A method according to any of the preceding claims and wherein said first and second temporal progressions comprise ordered intra-sequence representation-to-representation transformations at least some of which result from relative motion between sensors and a scene.
 57. A method according to any of the preceding claims and wherein said employing uses multiple combinations of intra-sequence representation-to-representation transformations.
 58. A method according to any of the preceding claims and wherein said spatial relationship between said at least first and second sequences of representations results from an acquisition relationship, between first and second sensors acquiring respective said at least first and second sequences, being fixed over time.
 59. A method according to any of the preceding claims and wherein said spatial relationship between said at least first and second sequences of representations results from an acquisition relationship, between first and second sensors acquiring respective said at least first and second sequences, changes in a known way over time.
 60. A method according to claim 58 or claim 59 and wherein said acquisition relationship comprises: relative position; relative orientation; and relative internal sensor parameters.
 61. A method according to claim 58 and wherein said acquisition relationship is known.
 62. A method according to claim 58 and wherein said acquisition relationship is not known.
 63. A method according to any of the preceding claims and wherein said at least first and second sequences are acquired generally at the same time.
 64. A method according to any of the preceding claims and wherein said at least first and second sequences are acquired generally at different times.
 65. A method according to any of the preceding claims and wherein said at least first and second sequences represent measurements from the same scene.
 66. A method according to any of the preceding claims and wherein said at least first and second sequences represent measurements from different portions of the same scene.
 67. A method according to any of the preceding claims and wherein said at least first and second sequences represent measurements from different overlapping portions of the same scene.
 68. A method according to any of the preceding claims and wherein said at least first and second sequences represent measurements from different non-overlapping portions of the same scene.
 69. A method according to any of the preceding claims and wherein said at least first and second sequences represent measurements from different scenes.
 70. A method according to any of the preceding claims 65-69 and wherein said scene is two-dimensional.
 71. A method according to any of the preceding claims 65-69 and wherein said scene is at least three-dimensional.
 72. A method according to any of the preceding claims 65-69 and wherein said scene is static.
 73. A method according to any of the preceding claims 65-69 and wherein said scene is dynamic.
 74. A method according to any of claims 65-73 and wherein said measurements are generally the same for each sensor.
 75. A method according to any of claims 65-73 and wherein said measurements are generally different for each sensor.
 76. A method according to any of claims 65-75 and wherein said measurements include at least one of: illumination, heat, radiance, electromagnetic radiation, color, distance, density, sound and speed.
 77. A method according to any of the preceding claims and also comprising employing at least one of said spatial and temporal relationships for sequence fusion.
 78. A method according to any of the preceding claims and also comprising employing at least one of said spatial and temporal relationships for alignment of sequences obtained at different zooms.
 79. A method according to any of the preceding claims and also comprising employing at least one of said spatial and temporal relationships for surveillance.
 80. A method according to any of the preceding claims and also comprising employing at least one of said spatial and temporal relationships for generation of wide-screen movies from multiple at least partially non-overlapping narrow field of view movies.
 81. A method according to any of the preceding claims and also comprising employing at least one of said spatial and temporal relationships for image fusion.
 82. A method according to any of the preceding claims and also comprising employing at least one of said spatial and temporal relationships for integrating information contained in said at least first and second sequences.
 83. A method according to any of the preceding claims and also comprising employing at least one of said spatial and temporal relationships for alignment of images obtained at different zooms.
 84. A method according to any of the preceding claims and also comprising employing at least one of said spatial and temporal relationships for comparing information contained in said at least first and second sequences.
 85. A method according to any of the preceding claims and also comprising employing at least one of said spatial and temporal relationships for finding differences between information contained in said at least first and second sequences.
 86. A method according to any of the preceding claims and also comprising employing at least one of said spatial and temporal relationships for finding differences between information contained in said at least first and second sequences relating to the same scene at different times.
 87. A method according to any of the preceding claims and also comprising employing at least one of said spatial and temporal relationships for integrating information contained in said at least first and second sequences and thereby providing an information output which exceeds limitations of individual sensors.
 88. A method according to any of the preceding claims and wherein said employing comprises: comparing properties of said first temporal progression and said second temporal progression.
 89. A system for computing at least one of spatial and temporal relationships between at least first and second sequences of representations having respective first and second temporal progressions, the system comprising: input functionality for receiving at least one of said first sequence of representations and said first temporal progression and at least one of said second sequence of representations and said second temporal progression; and computation functionality employing at least one of said first sequence of representations and said first temporal progression and at least one of said second sequence of representations and said second temporal progression to obtain at least one of said spatial and temporal relationships.
 90. A system for computing at least one of spatial and temporal relationships between at least first and second sequences of representations having respective first and second temporal progressions, the system comprising: input functionality for receiving said first and second temporal progressions; and computational functionality employing said first and second temporal progressions to obtain at least one of said spatial and temporal relationships.
 91. A system according to claim 89 and wherein said computation functionality includes functionality for computing said first and second temporal progressions which are then employed to obtain at least one of said spatial and temporal relationships.
 92. A system according to claim 90 and also comprising temporal progression computation functionality for computing said first and second temporal progressions and supplying them to said input functionality.
 93. A system according to any of claims 89-92 and wherein said representations comprise visual representations.
 94. A system according to any of claims 89-93 and wherein said representations comprise images.
 95. A system according to any of claims 89-94 and wherein said representations comprise at least three-dimensional objects.
 96. A system according to any of claims 89-95 and wherein said computation functionality includes functionality for obtaining said spatial relationship.
 97. A system according to any of claims 89-96 and wherein said computation functionality includes functionality for obtaining said temporal relationship.
 98. A system according to any of claims 89-97 and wherein said computation functionality includes functionality for obtaining said spatial relationship and said temporal relationship
 99. A system according to any of claims 89-98 and wherein said computation functionality includes functionality for obtaining said at least one of spatial and temporal relationships in the absence of a spatial overlap between said representations
 100. A system according to any of claims 89-99 and wherein said computation functionality includes functionality for obtaining said at least one of spatial and temporal relationships in the absence of common spatial information between said representations.
 101. A system according to any of claims 89-100 and wherein said computation functionality includes functionality for obtaining said at least one of spatial and temporal relationships in the absence of common information between individual ones of said representations belonging to different ones of said at least first and second sequences.
 102. A system according to any of claims 89-101 and wherein said computation functionality includes functionality for obtaining said at least one of spatial and temporal relationships in the absence of common information between any individual ones of said representations belonging to different ones of said at least first and second sequences.
 103. A system according to any of claims 89-102 and wherein said spatial relationship comprises at least one parameter of a geometric transformation between said at least first and second sequences of representations.
 104. A system according to claim 103 and wherein said spatial relationship includes a 2-dimensional projective transformation.
 105. A system according to claim 103 and wherein said spatial relationship includes a 3-dimensional projective transformation.
 106. A system according to claim 103 and wherein said spatial relationship includes a fundamental matrix.
 107. A system according to claim 103 and wherein said spatial relationship includes a 2-dimensional parametric transformation.
 108. A system according to claim 103 and wherein said spatial relationship includes an at least 3-dimensional parametric transformation.
 109. A system according to claim 103 and wherein said spatial relationship includes a 2-dimensional non-parametric transformation.
 110. A system according to claim 103 and wherein said spatial relationship includes an at least 3-dimensional non-parametric transformation.
 111. A system according to any of claims 103-110 and wherein said spatial relationship comprises a spatial relationship between individual ones of said representations belonging to different ones of said at least first and second sequences.
 112. A system according to any of claims 103-110 and wherein said spatial relationship comprises a spatial relationship between individual ones of said representations belonging to different ones of said at least first and second sequences, at least one of said individual ones of said representations being an interpolated representation.
 113. A system according to any of claims 103-110 and wherein said spatial relationship comprises a spatial relationship between individual ones of said representations belonging to different ones of said at least first and second sequences, one of said individual ones of said representations being an interpolated representation and the other of said individual ones of said representations being a non-interpolated representation.
 114. A system according to any of claims 89-113 and wherein said temporal relationship comprises at least one parameter of a temporal transformation between said at least first and second sequences of representations.
 115. A system according to claim 114 and wherein said temporal relationship includes a time shift between said at least first and second sequences of representations.
 116. A system according to claim 114 and wherein said temporal relationship includes an affine transformation in time.
 117. A system according to claim 114 and wherein said temporal relationship includes a parametric transformation in time.
 118. A system according to claim 114 and wherein said temporal relationship includes a non-parametric transformation in time.
 119. A system according to any of claims 114-118 and wherein said temporal relationship comprises a temporal relationship between individual ones of said representations belonging to different ones of said at least first and second sequences.
 120. A system according to any of claims 114-118 and wherein said temporal relationship comprises a temporal relationship between individual ones of said representations belonging to different ones of said at least first and second sequences, at least one of said individual ones of said representations being an interpolated representation.
 121. A system according to any of claims 114-118 and wherein said temporal relationship comprises a temporal relationship between individual ones of said representations belonging to different ones of said at least first and second sequences, one of said individual ones of said representations being an interpolated representation and the other of said individual ones of said representations being a non-interpolated representation.
 122. A system according to any of claims 112, 113, 120 and 121 and wherein said interpolated representation is interpolated in time.
 123. A system according to any of claims 112, 113, 120, 121 and 122 and wherein said interpolated representation is interpolated in space.
 124. A system according to any of claims 89-123 and wherein said first and second temporal progressions comprise ordered intra-sequence representation-to-representation transformations.
 125. A system according to any of claims 89-124 and wherein said first and second temporal progressions comprise ordered intra-sequence representation-to-representation transformations resulting from relative motion between sensors and a scene.
 126. A system according to either of claims 124 and 125 and wherein said intra-sequence representation-to-representation transformations include 2-dimensional projective transformations.
 127. A system according to either of claims 124 and 125 and wherein said intra-sequence representation-to-representation transformations include 3-dimensional projective transformations.
 128. A system according to either of claims 124 and 125 and wherein said intra-sequence representation-to-representation transformations include fundamental matrices.
 129. A system according to either of claims 124 and 125 and wherein said intra-sequence representation-to-representation transformations include 2-dimensional parametric transformations
 130. A system according to either of claims 124 and 125 and wherein said intra-sequence representation-to-representation transformations include at least 3-dimensional parametric transformations
 131. A system according to either of claims 124 and 125 and wherein said intra-sequence representation-to-representation transformations include 2-dimensional non-parametric transformations
 132. A system according to either of claims 124 and 125 and wherein said intra-sequence representation-to-representation transformations include at least 3-dimensional non-parametric transformations
 133. A system according to either of claims 124 and 125 and wherein said intra-sequence representation-to-representation transformations include camera matrices.
 134. A system according to any of claims 89-133 and wherein said computation functionality comprises: correlating said first and second temporal progressions.
 135. A system according to any of claims 89-134 and wherein said computation functionality comprises: equating properties of said first temporal progression and said second temporal progression.
 136. A system according to any of claims 89-135 and wherein said computation functionality comprises: correlating properties of said first temporal progression and said second temporal progression.
 137. A system according to any of claims 89-136 and wherein said computation functionality comprises: equating a sequential application of at least one of said intra-sequence representation-to-representation transformations of said first temporal progression and an unknown said spatial relationship between said at least first and second sequences with a sequential application of said unknown spatial relationship between said at least first and second sequences and at least one of said intra-sequence representation-to-representation transformations of said second temporal progression.
 138. A system according to any of claims 89-137 and wherein said computation functionality comprises: equating a composition of at least one of said intra-sequence representation-to-representation transformations of said first temporal progression and an unknown said spatial relationship between said at least first and second sequences with a composition of said unknown spatial relationship between said at least first and second sequences and at least one of said intra-sequence representation-to-representation transformations of said second temporal progression.
 139. A system according to any of claims 89-138 and wherein said computation functionality comprises: obtaining an unknown said spatial relationship between said at least first and second sequences by equating a sequential application of at least one of said intra-sequence representation-to-representation transformations of said first temporal progression and said unknown spatial relationship between said at least first and second sequences with a sequential application of said unknown spatial relationship between said at least first and second sequences and at least one of said intra-sequence representation-to-representation transformations of said second temporal progression.
 140. A system according to any of claims 135-139 and wherein equating includes equating up to a scale factor.
 141. A system according to any of claims 124-140 and wherein said intra-sequence representation-to-representation transformations include multiple simple motions taking place at least partially at different times.
 142. A system according to any of claims 124-141 and wherein said intra-sequence representation-to-representation transformations include multiple combinations of multiple simple motions taking place at least partially at different times.
 143. A system according to any of claims 124-142 and wherein said intra-sequence representation-to-representation transformations include multiple complex motions taking place at least partially at different times.
 144. A system according to any of claims 124-143 and wherein said intra-sequence representation-to-representation transformations include multiple combinations of multiple complex motions taking place at least partially at different times.
 145. A system according to any of claims 89-144 and wherein said first and second temporal progressions comprise ordered intra-sequence representation-to-representation transformations at least some of which result from relative motion between sensors and a scene.
 146. A system according to any of claims 89-145 and wherein said computation functionality uses multiple combinations of intra-sequence representation-to-representation transformations.
 147. A system according to any of claims 89-146 and wherein said spatial relationship between said at least first and second sequences of representations results from an acquisition relationship, between first and second sensors acquiring respective said at least first and second sequences, being fixed over time.
 148. A system according to any of claims 89-143 and wherein said spatial relationship between said at least first and second sequences of representations results from an acquisition relationship, between first and second sensors acquiring respective said at least first and second sequences, changes in a known way over time.
 149. A system according to claim 147 or claim 148 and wherein said acquisition relationship comprises: relative position; relative orientation; and relative internal sensor parameters.
 150. A system according to claim 147 and wherein said acquisition relationship is known.
 151. A system according to claim 147 and wherein said acquisition relationship is not known.
 152. A system according to any of claims 89-151 and wherein said at least first and second sequences are acquired generally at the same time.
 153. A system according to any of claims 89-152 and wherein said at least first and second sequences are acquired generally at different times.
 154. A system according to any of claims 89-153 and wherein said at least first and second sequences represent measurements from the same scene.
 155. A system according to any of claims 89-154 and wherein said at least first and second sequences represent measurements from different portions of the same scene.
 156. A system according to any of claims 89-155 and wherein said at least first and second sequences represent measurements from different overlapping portions of the same scene.
 157. A system according to any of claims 89-156 and wherein said at least first and second sequences represent measurements from different non-overlapping portions of the same scene.
 158. A system according to any of claims 89-157 and wherein said at least first and second sequences represent measurements from different scenes.
 159. A system according to any of claims 154-158 and wherein said scene is two-dimensional.
 160. A system according to any of claims 154-158 and wherein said scene is at least three-dimensional.
 161. A system according to any of claims 154-158 and wherein said scene is static.
 162. A system according to any of claims 154-158 and wherein said scene is dynamic.
 163. A system according to any of claims 154-162 and wherein said measurements are generally the same for each sensor.
 164. A system according to any of claims 154-162 and wherein said measurements are generally different for each sensor.
 165. A system according to any of claims 154-164 and wherein said measurements include at least one of: illumination, heat, radiance, electromagnetic radiation, color, distance, density, sound and speed.
 166. A system according to any of claims 89-165 and also comprising computational functionality includes functionality for employing at least one of said spatial and temporal relationships for sequence fusion.
 167. A system according to any of claims 89-166 and also comprising computational functionality includes functionality for employing at least one of said spatial and temporal relationships for alignment of sequences obtained at different zooms.
 168. A system according to any of claims 89-167 and also comprising computational functionality includes functionality for employing at least one of said spatial and temporal relationships for surveillance.
 169. A system according to any of claims 89-168 and also comprising computational functionality includes functionality for employing at least one of said spatial and temporal relationships for generation of wide-screen movies from multiple at least partially non-overlapping narrow field of view movies.
 170. A system according to any of claims 89-169 and also comprising computational functionality includes functionality for employing at least one of said spatial and temporal relationships for image fusion.
 171. A system according to any of claims 89-170 and also comprising computational functionality includes functionality for employing at least one of said spatial and temporal relationships for integrating information contained in said at least first and second sequences.
 172. A system according to any of claims 89-171 and also comprising computational functionality includes functionality for employing at least one of said spatial and temporal relationships for alignment of images obtained at different zooms.
 173. A system according to any of claims 89-172 and also comprising computational functionality includes functionality for employing at least one of said spatial and temporal relationships for comparing information contained in said at least first and second sequences.
 174. A system according to any of claims 89-173 and also comprising computational functionality includes functionality for employing at least one of said spatial and temporal relationships for finding differences between information contained in said at least first and second sequences.
 175. A system according to any of claims 89-174 and also comprising computational functionality includes functionality for employing at least one of said spatial and temporal relationships for finding differences between information contained in said at least first and second sequences relating to the same scene at different times.
 176. A system according to any of claims 89-175 and also comprising computational functionality includes functionality for employing at least one of said spatial and temporal relationships for integrating information contained in said at least first and second sequences and thereby providing an information output which exceeds limitations of individual sensors.
 177. A system according to any of claims 89-176 and wherein said computational functionality comprises: comparing properties of said first temporal progression and said second temporal progression. 